Parity theorems for statistics on permutations and Catalan words.
Shattuck, Mark (2005)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Some equidistributed statistics on Genocchi permutations.”
Parity theorems for statistics on permutations and Catalan words.
Variations on descents and inversions in permutations.
Chebikin, Denis (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-fixed-points-permutations.
Rakotondrajao, Fanja (2007)
Integers
Similarity:
Permutation patterns and continued fractions.
Robertson, Aaron, Wilf, Herbert S., Zeilberger, Doron (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutation statistics and -Fibonacci numbers.
Goyt, Adam M., Mathisen, David (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels.
Bousquet-Mélou, Mireille (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a balanced property of derangements.
Bóna, Miklós (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Reconstructing permutations from cycle minors.
Monks, Maria (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The -analogs of secant and tangent numbers.
Foata, Dominique, Han, Guo-Niu (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cyclic derangements.
Assaf, Sami H. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Restricted permutations, continued fractions, and Chebyshev polynomials.
Mansour, Toufik, Vainshtein, Alek (2000)
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:
Permutations avoiding an increasing number of length-increasing forbidden subsequences.
Barcucci, Elena, Del Lungo, Alberto, Pergola, Elisa, Pinzani, Renzo (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: