Enumeration on Row-Increasing Tableaux of Shape $2 \times n$
Abstract
Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape $2\times n$, and obtained a polynomial on the major index of these tableaux, which is a $q$-analogue of refined small Schröder numbers. We define row-increasing tableaux and study the major index and amajor index of row-increasing tableaux of shape $2 \times n$. The resulting polynomials are both $q$-analogues of refined large Schröder numbers. For both results we give bijective proofs.
Published
2019-03-22
How to Cite
Du, R. R., Fan, X., & Zhao, Y. (2019). Enumeration on Row-Increasing Tableaux of Shape $2 \times n$. The Electronic Journal of Combinatorics, 26(1), #P1.48. https://doi.org/10.37236/8087
Article Number
P1.48