A note on three types of quasisymmetric functions.
Petersen, T. Kyle (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations.”
A note on three types of quasisymmetric functions.
Meet and join within the lattice of set partitions.
Canfield, Rodney E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Signed words and permutations. II: The Euler-Mahonian polynomials.
Foata, Dominique, Han, Guo-Niu (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Records in set partitions.
Knopfmacher, Arnold, Mansour, Toufik, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On noncrossing and nonnesting partitions for classical reflection groups.
Athanasiadis, Christos A. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parking functions and noncrossing partitions.
Stanley, Richard P. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Consecutive patterns: from permutations to column-convex polyominoes and back.
Rawlings, Don, Tiefenbruck, Mark (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On partitions avoiding 3-crossings.
Bousquet-Mélou, Mireille, Xin, Guoce (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Variations on descents and inversions in permutations.
Chebikin, Denis (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parity theorems for statistics on permutations and Catalan words.
Shattuck, Mark (2005)
Integers
Similarity:
Signed words and permutations. III: The MacMahon Verfahren.
Foata, Dominique, Han, Guo-Niu (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Nonhomogeneous parking functions and noncrossing partitions.
Armstrong, Drew, Eu, Sen-Peng (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The permutation classes equinumerous to the smooth class.
Bóna, Miklós (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity: