# Cyclic Sieving of Increasing Tableaux

Abstract : An $\textit{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öder paths. Using the jeu de taquin for increasing tableaux of [Thomas–Yong '09], we then present a new instance of the cyclic sieving phenomenon of [Reiner–Stanton–White '04].
Keywords :
Document type :
Conference papers

Cited literature [9 references]

https://hal.inria.fr/hal-01229744
Contributor : Alain Monteil <>
Submitted on : Tuesday, November 17, 2015 - 10:20:57 AM
Last modification on : Thursday, August 1, 2019 - 2:12:06 PM
Long-term archiving on: : Friday, April 28, 2017 - 4:44:05 PM

### File

dmAS0128.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01229744, version 1

### Citation

Oliver Pechenik. Cyclic Sieving of Increasing Tableaux. 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013), 2013, Paris, France. pp.325-336. ⟨hal-01229744⟩

Record views