ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, let CnC_n be the cyclic group, let S~n,j−1\widetilde{{\mathfrak S}}_{n,j-1} be the set of decorated permutations with the specified excedance statistic, and let a~n,j(q)\widetilde a_{n,j}(q) be the associated polynomial.

Cyclic sieving conjecture. For any positive integer nn and 0≤j≤n0\leq j\leq n, the triple

(S~n,j−1, Cn, a~n,j(q))\left(\widetilde{{\mathfrak S}}_{n,j-1},~C_n,~\widetilde a_{n,j}(q)\right)

exhibits the cyclic sieving phenomenon.

The conjecture is motivated by the anticipated CnC_n-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.