ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be the bidirected cycle on nn vertices, and let Cn,m,i\mathcal{C}_{n,m,i} denote the unique recurrent component of level mm and weight i∈Zni\in\mathbb{Z}_n. Write r(Cn,m,i)r(\mathcal{C}_{n,m,i}) for the number of recurrent configurations in this component.

Recurrent-component cardinality conjecture. For n≥3n\geq 3, m≥1m\geq 1, and i,j∈Zni,j\in\mathbb{Z}_n, one has

r(Cn,m,i)=r(Cn,m,j)r(\mathcal{C}_{n,m,i})=r(\mathcal{C}_{n,m,j})

whenever

gcd⁡(n,m,i)=gcd⁡(n,m,j).\gcd(n,m,i)=\gcd(n,m,j).

The conjecture refines the observed near equality of recurrent-component sizes in sinkless rotor networks on bidirected cycles. It is supported by data for small values of mm and nn, but the supplied source does not state a resolution.

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.