Conjectures on the enumeration of tableaux of bounded height

DOI10.1016/0012-365X(94)00148-CzbMath0833.05079OpenAlexW4297994425WikidataQ122931518 ScholiaQ122931518MaRDI QIDQ1894003

François Bergeron, Daniel Krob, Favreau, Luc

Publication date: 11 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00148-c

zbMATH Keywords

generating functionspolynomialsenumerationconjecturestandard Young tableauxrecurrencesrecursive sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10)

Related Items (4)

Stieltjes moment sequences for pattern-avoiding permutations ⋮ Vertex operators for standard bases of the symmetric functions ⋮ Identities in character tables ofS_n ⋮ Kronecker coefficients for some near-rectangular partitions

Cites Work

• Unnamed Item
• A holonomic systems approach to special functions identities
• Asymptotic values for degrees associated with strips of Young diagrams

This page was built for publication: Conjectures on the enumeration of tableaux of bounded height