Combinatorial properties of the numbers of tableaux of bounded height

zbMATH Open1224.05500arXiv0803.2112MaRDI QIDQ3077321FDOQ3077321

Marilena Barnabei, Flavio Bonetti, Matteo Silimbani

Publication date: 22 February 2011

Abstract: We introduce an infinite family of lower triangular matrices $Gamm{a}^{(s)}$, where $gamm{a}_{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 $a{u}_s(n)$ of tableaux on $n$ cells and with at most $s$ columns.

Full work available at URL: https://arxiv.org/abs/0803.2112

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
• On standard Young tableaux of bounded height
• Combinatorial properties of permutation tableaux
• scientific article; zbMATH DE number 6928814

zbMATH Keywords

Young tableaux

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Factorials, binomial coefficients, combinatorial functions (05A10)

Cited In (5)

• Enumeration of generalized Young tableaux with bounded height
• Title not available (Why is that?)
• Title not available (Why is that?)
• Young tableaux with periodic walls: counting with the density method
• Conjectures on the enumeration of tableaux of bounded height

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)