Combinatorial properties of the numbers of tableaux of bounded height

Simple item page
dc.creatorBarnabei, M.
dc.creatorBonetti, F.
dc.creatorSilimbani, M.
dc.date2008-03-14
dc.date.accessioned2026-07-07T09:26:51Z
dc.date.available2026-07-07T09:26:51Z
dc.descriptionWe introduce an infinite family of lower triangular matrices $Γ^{(s)}$, where $γ_{n,i}^s$ counts the standard Young tableaux on $n$ cells and with at most $s$ 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 $τ_s(n)$ of tableaux on $n$ cells and with at most $s$ columns.
dc.description11 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0803.2112
dc.identifierhttp://arxiv.org/abs/0803.2112
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156899
dc.subjectCombinatorics
dc.subject05E10. 05A15
dc.titleCombinatorial properties of the numbers of tableaux of bounded height
dc.typetext

Files

Collections

arXiv