Enumerating segmented patterns in compositions and encoding by restricted permutations.
Kitaev, Sergey, McAllister, Tyrrell B., Petersen, T. Kyle (2006)
Integers
Similarity:
Displaying similar documents to “A generalized major index statistic.”
Enumerating segmented patterns in compositions and encoding by restricted permutations.
Wilf-equivalence on -ary words, compositions, and parking functions.
Jelínek, Vít, Mansour, Toufik (2009)
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:
Prefix exchanging and pattern avoidance by involutions.
Jaggard, Aaron D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Positivity for special cases of -Kostka coefficients and standard tableaux statistics.
Zabrocki, Mike (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generalized Dumont-Foata polynomials and alternative tableaux.
Josuat-Vergès, Matthieu (2010)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
A color-to-spin domino Schensted algorithm.
Shimozono, Mark, White, Dennis E. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Variations on descents and inversions in permutations.
Chebikin, Denis (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The skeleton of a reduced word and a correspondence of Edelman and Green.
Felsner, Stefan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Classification of bijections between 321- and 132-avoiding permutations.
Claesson, Anders, Kitaev, Sergey (2008)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Cyclic sieving for longest reduced words in the hyperoctahedral group.
Petersen, T.Kyle, Serrano, Luis (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generating functions for permutations which contain a given descent set.
Remmel, Jeffrey, Riehl, Manda (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chains, subwords, and fillings: strong equivalence of three definitions of the Bruhat order.
Zara, Catalin (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: