Standard Young tableaux of height 4 and 5

DOI10.1016/S0195-6698(89)80034-4zbMath0672.05012MaRDI QIDQ1119584

Dominique Gouyou-Beauchamps

Publication date: 1989

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

stacksgenerating functionsinvolutionsstandard Young tableauxMotzkin wordspairs of non-crossing Dyck paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items

Watermelon uniform random generation with applications, Weighted lattice walks and universality classes, Bijections between walks inside a triangular domain and Motzkin paths of bounded amplitude, Dénombrements de chemins dans $\mathbb {R}^2$ soumis à contraintes, Stack words, standard tableaux and Baxter permutations, Bijections between Łukasiewicz walks and generalized tandem walks, The combinatorics of a tree-like functional equation for connected chord diagrams, Pattern avoidance in matchings and partitions, Symmetric functions and P-recursiveness, Skew-standard tableaux with three rows, A holonomic systems approach to special functions identities, The number of involutions with \(r\) fixed points and a long increasing subsequence, Generating-tree isomorphisms for pattern-avoiding involutions, Crossings and nestings for arc-coloured permutations and automation, Dominant maximal weights of highest weight modules and Young tableaux, A linear operator for symmetric functions and tableaux in a strip with given trace, Unnamed Item, Baxter permutations and plane bipolar orientations, Decreasing subsequences in permutations and Wilf equivalence for involutions, Standard Young tableaux in a \(( 2 , 1 )\)-hook and Motzkin paths, Random k -noncrossing RNA structures, Probabilities in the \((k,l)\) hook, Unnamed Item, On two related questions of Wilf concerning standard Young tableaux, Transcendence of binomial and Lucas' formal power series, Symmetric Schröder paths and restricted involutions, A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths, Crossings and nestings of matchings and partitions, Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset, Kronecker coefficients for some near-rectangular partitions, Bijections for pairs of non-crossing lattice paths and walks in the plane, Weight Multiplicities and Young Tableaux Through Affine Crystals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof
• A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
• Binomial determinants, paths, and hook length formulae
• Shuffle of parenthesis systems and Baxter permutations
• Differentiably finite power series
• Combinatorial aspects of continued fractions
• Enumeration of partitions with hooklengths
• An extension of Schensted's theorem
• Reverse plane partitions and tableau hook numbers
• A probabilistic proof of a formula for the number of Young tableaux of a given shape
• Permutations selon leurs pics, creux, doubles montees et double descentes, nombres d'Euler et nombres de Genocchi
• Asymptotic values for degrees associated with strips of Young diagrams
• The enumeration of Hamiltonian polygons in triangular maps
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• A Census of Hamiltonian Polygons
• Bijective proofs of formulae for the number of standard Yound tableaux
• A bijective proof of the hook-length formula
• Quelques remarques sur une Construction de Schensted.
• On the Representations of the Symmetric Group: (Third Paper)
• The Hook Graphs of the Symmetric Group