Affordable Access

Combinatorial properties of the numbers of tableaux of bounded height

Authors
Publication Date
Keywords
  • Mat/02 Algebra

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.

There are no comments yet on this publication. Be the first to share your thoughts.