Combinatorial properties of the numbers of tableaux of bounded height

Barnabei, Marilena ; Bonetti, Flavio ; Silimbani, Matteo (2008) Combinatorial properties of the numbers of tableaux of bounded height. [Preprint]
Full text available as:
[thumbnail of bounded_height.pdf]
Preview
PDF
Download (142kB) | Preview

Abstract

We introduce an infinite family of lower triangular matrices ¡(s), where °s n;i 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.

Abstract
Document type
Preprint
Creators
CreatorsAffiliationORCID
Barnabei, Marilena
Bonetti, Flavio
Silimbani, Matteo
Keywords
Tabelle di Young, combinatoria enumerativa
Subjects
DOI
Deposit date
28 Mar 2008
Last modified
16 May 2011 12:07
URI

Other metadata

This work may be freely consulted and used, may be reproduced on a permanent basis in a digital format (i.e. saving) and can be printed on paper with own personal equipment (without availing of third -parties services), for strictly and exclusively personal, research or teaching purposes, with express exclusion of any direct or indirect commercial use, unless otherwise expressly agreed between the user and the author or the right holder. It is also allowed, for the same purposes mentioned above, the retransmission via telecommunication network, the distribution or sending in any form of the work, including the personal redirection (e-mail), provided it is always clearly indicated the complete link to the page of the Alma DL Site in which the work is displayed. All other rights are reserved.

Downloads

Downloads

Staff only: View the document

^