Cyclic sieving of increasing tableaux and small Schröder paths

From MaRDI portal
Publication:2451908

DOI10.1016/J.JCTA.2014.04.002zbMATH Open1295.05265arXiv1209.1355OpenAlexW2170019006MaRDI QIDQ2451908FDOQ2451908

Oliver Pechenik

Publication date: 26 May 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a bijection between rectangular 2-row increasing tableaux and small Schr"oder paths. We demonstrate relations between the jeu de taquin for increasing tableaux developed by H. Thomas and A. Yong and the combinatorics of tropical frieze patterns. We then use this jeu de taquin to present new instances of the cyclic sieving phenomenon of V. Reiner, D. Stanton, and D. White, generalizing results of D. White and of J. Stembridge.


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





Cites Work


Cited In (39)






This page was built for publication: Cyclic sieving of increasing tableaux and small Schröder paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451908)