← All problems

Conjecture on recurrent component cardinalities in sinkless rotor networks

8 years old · traced to

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.

References
  1. Swee Hong Chan and Lionel Levine, “Abelian networks IV. Dynamics of nonhalting networks”, arXiv:1804.03322 (2020).

Progress summary

Refreshed
Open · progress reported

A reader-submitted preprint claims a complete proof, but no independent verification was found, so the conjecture remains open in the public record.

The conjecture, attributed to Chan and Levine, asserts that recurrent-component sizes on bidirected cycles depend on gcd⁡(n,m,i)\gcd(n,m,i) alone. Their 2018 source records the conjecture and reports no resolution as of April 2018.

Community submission (unverified), November 7, 2026

A submitted proof argues that Chan and Levine's conjecture holds for all n≥3n \ge 3 and m≥1m \ge 1, including existence and uniqueness of the recurrent components. It links a purported complete proof, but the submission itself is unverified and supplies no independent mathematical assessment.

Current status (as of November 2026): The conjecture was unresolved in the latest independently retrieved source, while a November 7, 2026 community submission claims a complete proof; that claim is unverified.

Sources

Solutions 1

Gcd symmetry of recurrent-component sizes for the rotor network on the bidirected cycle (Chan-Levine Conjecture 8.3)See full solutionHide full solution

Result and scope. Chan and Levine, Abelian networks IV. Dynamics of nonhalting networks, arXiv:1804.03322 v1/v2; Mem. Amer. Math. Soc. 276 (2022), no. 1358, Conjecture 8.3: for the rotor network on the bidirected cycle C_n, n ≥ 3, m ≥ 1, the number of recurrent configurations in the unique recurrent component C_{n,m,i} of level m and weight i depends only on gcd(n, m, i). Proved for all n ≥ 3 and m ≥ 1, in the source's network language, with component existence and uniqueness proved.

Complete proof: Gcd symmetry of recurrent-component sizes for the rotor network on the bidirected cycle (Chan-Levine Conjecture 8.3) · PDF.

The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.

This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.