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

Myeongjin Kang

Abstract

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.

AI-assisted research preprint. The scoped main statement has a Lean certificate. Internal AI review is not external journal peer review; bounded prior-art searches do not certify worldwide priority. See the paper for exact qualifications and formalization limits.

3

Supplementary files

  • proof-sources.json130.3 KBOpen
  • extract_sources.py430 BOpen

Comments

Submitted by Myeongjin Kang. Related MathDB problem 338887. Proof sources are attached as proof-sources.json (gzip-compressed, base64-encoded file contents); extract_sources.py reconstructs all archived files. Original archive SHA-256: 9e685235e4d744adf9fdd5cafaccf874c6ef6fbccff4684003133df75da34bb0.

Version history

Discussion 0