Promotion and cyclic sieving via webs
Combinatorics
2008-04-22 v1
Abstract
We show that Sch\"utzenberger's promotion on two and three row rectangular Young tableaux can be realized as cyclic rotation of certain planar graphs introduced by Kuperberg. Moreover, following work of the third author, we show that this action admits the cyclic sieving phenomenon.
Cite
@article{arxiv.0804.3375,
title = {Promotion and cyclic sieving via webs},
author = {T. Kyle Petersen and Pavlo Pylyavskyy and Brendon Rhoades},
journal= {arXiv preprint arXiv:0804.3375},
year = {2008}
}
Comments
23 pages