Asymptotics of the number of -words with an -descent.
Regev, Amitai (1998)
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.
Displaying similar documents to “Increasing subsequences and the classical groups.”
Asymptotics of the number of -words with an -descent.
A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations.
Winkel, Rudolf (1996)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Truncations of random unitary matrices and Young tableaux.
Novak, J. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On descents in standard Young tableaux.
Hästö, Peter A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Eulerian enumeration of involutions.
Chow, Chak-On (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Total positivity for cominuscule Grassmannians.
Lam, Thomas, Williams, Lauren (2008)
The New York Journal of Mathematics [electronic only]
Similarity:
Schur functions and alternating sums.
van Leeuwen, Marc A.A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A color-to-spin domino Schensted algorithm.
Shimozono, Mark, White, Dennis E. (2001)
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:
Generating functions for permutations which contain a given descent set.
Remmel, Jeffrey, Riehl, Manda (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:
Affine Weyl groups as infinite permutations.
Eriksson, Henrik, Eriksson, Kimmo (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Subsequence containment by involutions.
Jaggard, Aaron D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity: