Enumeration of bounded lecture hall tableaux

Abstract

Recently the authors introduced lecture hall tableaux in their study of multivariate little q-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 sλ(m+y1,…,m+yn). 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…