Conjectures on the enumeration of tableaux of bounded height
From MaRDI portal
Publication:1894003
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
generating functionspolynomialsenumerationconjecturestandard Young tableauxrecurrencesrecursive sequences
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 ofSn ⋮ Kronecker coefficients for some near-rectangular partitions
Cites Work
This page was built for publication: Conjectures on the enumeration of tableaux of bounded height