Sciweavers

492 search results - page 61 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
2000
71views more  COMBINATORICS 2000»
14 years 9 months ago
Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particul...
Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
14 years 9 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
COMBINATORICS
2002
76views more  COMBINATORICS 2002»
14 years 9 months ago
On the Number of Distributive Lattices
We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and...
Marcel Erné, Jobst Heitzig, Jürgen Rei...
COMBINATORICS
1999
100views more  COMBINATORICS 1999»
14 years 9 months ago
Positivity for special cases of (q, t)-Kostka coefficients and standard tableaux statistics
We present two symmetric function operators Hqt 3 and Hqt 4 that have the property Hqt mH(2a1b)(X; q, t) = H(m2a1b)(X; q, t). These operators are generalizations of the analogous ...
Mike Zabrocki
COMBINATORICS
2004
82views more  COMBINATORICS 2004»
14 years 9 months ago
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
R. Bruce Richter