\documentclass[11pt,letterpaper]{amsart} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{amsmath,amssymb,amsthm} \usepackage{longtable} \usepackage{float} \usepackage[margin=1.25in]{geometry} \usepackage{microtype} \usepackage[colorlinks=true,allcolors=blue]{hyperref} \hypersetup{pdftitle={Nowhere-zero flow reconfiguration in every finite abelian group of order at least 3024}, pdfauthor={Dave Goel}} \def\InterfaceMacrosOnly{} \input{interface} \input{Bphase1_macros} \input{B1_macros} \raggedbottom \emergencystretch=1.5em \begin{document} \title[Flow reconfiguration in abelian groups of order at least 3024]{Nowhere-zero flow reconfiguration in every finite abelian group of order at least 3024} \author{Dave Goel} \dedicatory{\upshape\footnotesize Version 1.20 --- October 23, 2026} \begin{abstract} For a finite multigraph $G$ and a finite abelian group $\Gamma$, let $F(G,\Gamma)$ be the graph on the nowhere-zero $\Gamma$-flows of $G$ in which two flows are adjacent if the support of their difference is a cycle. We prove that $F(G,\Gamma)$ is connected for every finite bridgeless multigraph $G$ and every finite abelian group $\Gamma$ of order at least $3024$. The previous bound for all finite abelian groups, due to Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner, is a number with $694$ digits; for the cyclic groups of prime order $p$ their bound is $p>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 $d$ with $4\le d\le|\Gamma|/10$; from the order $100$ 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 $\mathbb{Z}_n$ we use units of $\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 $3999$ on, and a finite arithmetic certificate with $230$ rows settles the orders from $3024$ to $3998$. \end{abstract} \maketitle \input{B0_intro} \input{B1_tools} \input{B2_middle_band} \input{B3_units} \input{B4_scale} \input{B5_product} \input{B6_hits} \input{B7_prime_powers} \input{B8_coarse} \input{B9_band} \input{B10_small} \input{B11_boundary} \appendix \input{BApp_certificate} \section*{Acknowledgments} 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. \begin{thebibliography}{EHLMNS} \bibitem[A]{A} D. Goel, \emph{Flow reconfiguration with one modulus for all graphs, and Cereceda's conjecture for bipartite $2$-degenerate graphs}, version 2.30, Zenodo, 2026, \url{https://doi.org/10.5281/zenodo.23603238}. \bibitem[CLSWX]{CLSWX} D. W. Cranston, J. Li, B. Su, Z. Wang, and N. Xu, \emph{Reconfiguration of nowhere-zero flows}, arXiv:2606.24685v1, 2026. \bibitem[EHLMNS]{EHLMNS} L. Esperet, K. Hendrey, A. Lagoutte, M. Marseloo, S. Norin, and R. Steiner, \emph{Nowhere-zero flow reconfiguration}, \href{https://arxiv.org/abs/2512.17342v4}{arXiv:2512.17342v4}, July 3, 2026. \bibitem[Sey]{Seymour} P. D. Seymour, \emph{Nowhere-zero $6$-flows}, J. Combin. Theory Ser. B 30 (1981), 130--135. \end{thebibliography} \end{document}