Nowhere-zero flow reconfiguration in every finite abelian group of order at least 3024

A mix of human-written and AI-generated textHuman understanding: some partsmath.CO — Combinatorics

Contributed by Dave Goel ↗

Version 1 / Nov 16, 2026 / CC BY-SA 4.0

Abstract

For a finite multigraph GG and a finite abelian group Γ\Gamma, let F(G,Γ)F(G,\Gamma) be the graph on the nowhere-zero Γ\Gamma-flows of GG in which two flows are adjacent if the support of their difference is a cycle. We prove that F(G,Γ)F(G,\Gamma) is connected for every finite bridgeless multigraph GG and every finite abelian group Γ\Gamma of order at least 30243024. The previous bound for all finite abelian groups, due to Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner, is a number with 694694 digits; for the cyclic groups of prime order pp their bound is p>2.26⋅1015p>2.26\cdot 10^{15}. A theorem of an earlier paper of the author covers every group that is not cyclic of prime-power order and whose order has a divisor dd with 4≤d≤∣Γ∣/104\le d\le|\Gamma|/10; from the order 100100 on, it leaves only the cyclic groups whose order is a prime power, twice a prime or three times a prime. For a cyclic factor Zn\mathbb{Z}_n we use units of Zn\mathbb{Z}_n as scales, and we average over a set of scales that is generated by good units. Counts of the bad units settle the orders from 39993999 on, and a finite arithmetic certificate with 230230 rows settles the orders from 30243024 to 39983998.

Author comments: First version: October 23, 2026. The ancillary files of this paper (a certificate checker) are at https://doi.org/10.5281/zenodo.23605837 on Zenodo.

Provenance statement

This work was done overwhelmingly by AI models and supervised by the author. The models were Anthropic's Claude and OpenAI's ChatGPT. The author takes full responsibility for the paper.

References

  1. D. Goel, Flow reconfiguration with one modulus for all graphs, and Cereceda's conjecture for bipartite 22-degenerate graphs , version 2.30, Zenodo, 2026, https://doi.org/10.5281/zenodo.23603238.DOI
  2. D. W. Cranston, J. Li, B. Su, Z. Wang, and N. Xu, Reconfiguration of nowhere-zero flows , arXiv:2606.24685v1, 2026.arXiv
  3. L. Esperet, K. Hendrey, A. Lagoutte, M. Marseloo, S. Norin, and R. Steiner, Nowhere-zero flow reconfiguration , arXiv:2512.17342v4 (https://arxiv.org/abs/2512.17342v4), July 3, 2026.arXiv
  4. P. D. Seymour, Nowhere-zero 66-flows , J. Combin. Theory Ser. B 30 (1981), 130--135.

Version history

  1. v1 · 32 pagesSubmitted by Dave GoelFirst version: October 23, 2026. The ancillary files of this paper (a certificate checker) are at https://doi.org/10.5281/zenodo.23605837 on Zenodo.CurrentNov 16, 2026