Combinatorial properties of the numbers of tableaux of bounded height
From MaRDI portal
Publication:3077321
Abstract: We introduce an infinite family of lower triangular matrices , where counts the standard Young tableaux on cells and with at most columns on a suitable subset of shapes. We show that the entries of these matrices satisfy a three-term row recurrence and we deduce recursive and asymptotic properties for the total number of tableaux on cells and with at most columns.
Recommendations
- Conjectures on the enumeration of tableaux of bounded height
- Publication:4723747
- scientific article; zbMATH DE number 1522340
- Enumeration of generalized Young tableaux with bounded height
- Determinant formulas relating to tableaux of bounded height
- Cominuscule tableau combinatorics
- scientific article; zbMATH DE number 2127880
- On standard Young tableaux of bounded height
- Combinatorial properties of permutation tableaux
- scientific article; zbMATH DE number 6928814
Cited in
(5)- Conjectures on the enumeration of tableaux of bounded height
- Enumeration of generalized Young tableaux with bounded height
- scientific article; zbMATH DE number 3995692 (Why is no real title available?)
- Young tableaux with periodic walls: counting with the density method
- scientific article; zbMATH DE number 1522340 (Why is no real title available?)
This page was built for publication: Combinatorial properties of the numbers of tableaux of bounded height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077321)