Enumeration of bounded lecture hall tableaux
Combinatorics
2019-11-07 v2
Abstract
Recently the authors introduced lecture hall tableaux in their study of multivariate little -Jacobi polynomials. In this paper, we enumerate bounded lecture hall tableaux. We show that their enumeration is closely related to standard and semistandard Young tableaux. We also show that the number of bounded lecture hall tableaux is the coefficient of the Schur expansion of . To prove this result, we use two main tools: non-intersecting lattice paths and bijections. In particular we use ideas developed by Krattenthaler to prove bijectively the hook content formula.
Keywords
Cite
@article{arxiv.1904.10602,
title = {Enumeration of bounded lecture hall tableaux},
author = {Sylvie Corteel and Jang Soo Kim},
journal= {arXiv preprint arXiv:1904.10602},
year = {2019}
}
Comments
22 pages, 18 figures