The cyclic sieving conjecture for decorated permutations and extended codes
Statement
For a positive integer , let be the cyclic group, let be the set of decorated permutations with the specified excedance statistic, and let be the associated polynomial.
Cyclic sieving conjecture. For any positive integer and , the triple
exhibits the cyclic sieving phenomenon.
The conjecture is motivated by the anticipated -equivariant bijection between decorated permutations and extended Stembridge codes. The supplied text gives no resolution evidence, so its status remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.