Generating functions for permutations which contain a given descent set.
Remmel, Jeffrey, Riehl, Manda (2010)
The Electronic Journal of Combinatorics [electronic only]
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.
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.
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.
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 “On the Eulerian enumeration of involutions.”
Generating functions for permutations which contain a given descent set.
Subsequence containment by involutions.
Jaggard, Aaron D. (2005)
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:
Consecutive patterns: from permutations to column-convex polyominoes and back.
Rawlings, Don, Tiefenbruck, Mark (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Asymptotics of the number of -words with an -descent.
Regev, Amitai (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Matrices connected with Brauer's centralizer algebras.
McKerihan, Mark D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The combinatorics of the Garsia-Haiman modules for hook shapes.
Adin, Ron M., Remmel, Jeffrey B., Roichman, Yuval (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Three-letter-pattern avoiding permutations and functional equations.
Firro, Ghassan, Mansour, Toufik (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Increasing subsequences and the classical groups.
Rains, E.M. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The combinatorics of orbital varieties closures of nilpotent order 2 in .
Melnikov, Anna (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multiple pattern avoidance with respect to fixed points and excedances.
Elizalde, Sergi (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations.
Winkel, Rudolf (1996)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Total positivity for cominuscule Grassmannians.
Lam, Thomas, Williams, Lauren (2008)
The New York Journal of Mathematics [electronic only]
Similarity: