Dihedral Sieving on Cluster Complexes
Combinatorics
2021-10-27 v2 Representation Theory
Abstract
The cyclic sieving phenomenon of Reiner, Stanton, and White characterizes the stabilizers of cyclic group actions on finite sets using q-analogue polynomials. Eu and Fu demonstrated a cyclic sieving phenomenon on generalized cluster complexes of every type using the q-Catalan numbers. In this paper, we exhibit the dihedral sieving phenomenon, introduced for odd n by Rao and Suk, on clusters of every type. In the type A case, we show that the Raney numbers count both reflection-symmetric k-angulations of an n-gon and a particular evaluation of the (q,t)-Fuss--Catalan numbers. We also introduce a sieving phenomenon for the symmetric group, and discuss possibilities for dihedral sieving for even n.
Cite
@article{arxiv.2011.11885,
title = {Dihedral Sieving on Cluster Complexes},
author = {Zachary Stier and Julian Wellman and Zixuan Xu},
journal= {arXiv preprint arXiv:2011.11885},
year = {2021}
}
Comments
26 pages, 13 figures