2000 character limit reached
A new cyclic sieving phenomenon for Catalan objects
Published 15 Jan 2016 in math.CO | (1601.03999v2)
Abstract: Based on computational experiments, Jim Propp and Vic Reiner suspected that there might exist a sequence of combinatorial objects $X_n$, each carrying a natural action of the cyclic group $C_{n-1}$ of order $n-1$ such that the triple $\left(X_n,C_{n-1},\frac{1}{[n+1]_q}{2n \brack n}_q\right)$ exhibits the cyclic sieving phenomenon. We prove their suspicion right.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.