Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Cyclic Sieving of In ...
Conference paper

Cyclic Sieving of Increasing Tableaux

Oliver Pechenik (1)
(1) Department of Mathematics [Urbana]
Download article
Open on HAL
Imported on
November 20, 2016
Published on
December 31, 2012
Last modified on
April 1, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.12815
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
0838434
EMSW21-MCTP: Research Experience for Graduate Students
Indicators
409
Views
450
Downloads

Cyclic Sieving of Increasing Tableaux

Oliver Pechenik (1)
(1) Department of Mathematics [Urbana]
Abstract
English
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].
French
Un $\textit{tableau croissant}$ est un tableau semi-standard avec les lignes et les colonnes croissantes au sens strict. Il est bien connu que les nombres de Catalan énumèrent les tableaux de Young standard rectangulaires de deux lignes et aussi les chemins de Dyck. Nous généralisons ceci pour une bijection entre tableaux croissants rectangulaires à 2 lignes et petits chemins de Schröder. Utilisant le jeu de taquin de [Thomas–Yong ’09] pour tableaux croissants, nous préesentons ensuite une nouvelle instance du phénomène du crible cyclique de [Reiner–Stanton–White ’04].
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • increasing tableaux
  • cyclic sieving phenomenon
  • K-promotion
  • Schröder path
  • Schröder number
  • noncrossing partition
Preview
Loading PDF preview...