We introduce an infinite family of lower triangular matrices $Gamma^(s)$, where $gamma^(s)_{n,i}$ counts the standard Young tableaux on n cells, with at most s columns, whose second and third column lengths differ by i. 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 s(n) of tableaux on n cells and with at most s columns.
M. Barnabei, F. Bonetti, M. Silimbani (2007). Combinatorial properties of the numbers of tableaux of bounded height. PURE MATHEMATICS AND APPLICATIONS, 18, 213-222.
Combinatorial properties of the numbers of tableaux of bounded height
BARNABEI, MARILENA;BONETTI, FLAVIO;SILIMBANI, MATTEO
2007
Abstract
We introduce an infinite family of lower triangular matrices $Gamma^(s)$, where $gamma^(s)_{n,i}$ counts the standard Young tableaux on n cells, with at most s columns, whose second and third column lengths differ by i. 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 s(n) of tableaux on n cells and with at most s columns.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
