\newcommand{\Z}{\mathbb{Z}} \newcommand{\Gam}{\Gamma} % \newcommand{\quo}[1]{\overline{#1}} % \newcommand{\Sig}{\Sigma} % \newcommand{\SigA}{\Sigma_A} % \newcommand{\SigB}{\Sigma_B} % \newcommand{\lift}{\gamma} % \newcommand{\Fl}{F} % \newcommand{\Ik}[1][k]{I_{#1}} % \newcommand{\Mk}[1][k]{M_{#1}} % \newcommand{\supp}{\operatorname{supp}} \newcommand{\eps}{\varepsilon} % \newcommand{\len}{\ell} % \newcommand{\thr}[1]{P_{#1}} % \newcommand{\HP}{H_P} % \newcommand{\Deps}{D_{\eps}} % \newcommand{\Te}{T^{e}} % \newcommand{\Tg}{T^{g}} % \newcommand{\red}{\mathrm{red}} % \newcommand{\Lam}{\Lambda} % \newcommand{\PL}[1]{P(#1)} % \newcommand{\RI}{\textup{(R1)}} \newcommand{\RIm}{\textup{(R1$^-$)}} \newcommand{\RII}{\textup{(R2)}} \newcommand{\RIII}{\textup{(R3$^*$)}} \newcommand{\AV}{\textup{(AV)}} \newcommand{\AVpp}{\textup{(AV$''$)}} \newcommand{\Hone}{\textup{(H1)}} \newcommand{\Htwo}{\textup{(H2)}} \newcommand{\Czero}{\textup{(C0)}} \newcommand{\Cone}{\textup{(C1)}} \newcommand{\Ctwo}{\textup{(C2)}} \newcommand{\Cthree}{\textup{(C3)}} \newcommand{\Cfour}{\textup{(C4)}} \newcommand{\condS}{\textup{(S)}} \newcommand{\condNR}{\textup{(NR)}} \newcommand{\condLone}{\textup{(L1)}} \newenvironment{condlist}[1]{\begin{list}{}{% \settowidth{\labelwidth}{\textup{#1}}\setlength{\labelsep}{0.5em}% \setlength{\leftmargin}{\labelwidth}\addtolength{\leftmargin}{\labelsep}% \setlength{\itemsep}{2pt}\setlength{\topsep}{4pt}\setlength{\parsep}{2pt}\setlength{\listparindent}{0pt}}}% {\end{list}} \theoremstyle{plain} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{criterion}[theorem]{Criterion} \theoremstyle{definition} \newtheorem{definition}[theorem]{Definition} \newtheorem{remark}[theorem]{Remark} \ifdefined\InterfaceMacrosOnly \expandafter\endinput \fi \noindent{\footnotesize Interface file \texttt{interface.tex}, version 0.10, 2026-10-04. It has the notation and the final wording of the statements that the sections of Paper~A (``One modulus for all graphs'') and of Paper~B (``Groups'') share. No proof is in this file. The count table, which is the skeleton of the proof of Theorem~\ref{thm:master}, is in \texttt{interface\_notes.md}.\par} \section{Notation}\label{sec:notation} Each symbol and each word has one meaning in the two papers. {\small \begin{longtable}{@{}p{0.27\textwidth}p{0.69\textwidth}@{}} \hline \textbf{Symbol or word} & \textbf{The one meaning (and what is not allowed)}\\ \hline \endhead $\Gam$, $B$, $A$, $\quo{x}$ & $\Gam$ a finite abelian group, $B$ a subgroup, $A=\Gam/B$, $x\mapsto\quo{x}$ the quotient map. Never ``$A\times B$'' for the whole group. $A$, $B$ are groups only.\\ $A'$ & an extra direct factor (Paper~B: $\Z_n\times A'$).\\ $\Fl(G,\Gam)$, $\Mk(G)$, $\Ik(G)$ & the three reconfiguration graphs; $\Mk(G)=\Fl(G,\Z_k)$.\\ $k=ab$ & the modulus and its two factors: $a=|A|$, $b=|B|$. $k_0$: a base modulus. $q$: a divisor.\\ $p$ & a prime number only.\\ $\Sig$, $\SigA$, $\SigB$ & a step system, its $A$-parts, its steps in $B$. No other letter for a step set ($S_0=\{-27,\dots,27\}$ only in Paper~B).\\ $\lift(s)$, $\beta$ & the fixed lift of $s\in\SigA$; the $B$-part of a lift (product case).\\ $d(a)$, $\varphi$, $\psi$, $\theta$ & the number of divisors of $a$; Euler's function; a map $E(H)\to\Z$; a potential.\\ $n$, $m$ & the numbers of vertices and of edges of a graph (in Paper~B also: the order of $\Z_n$).\\ $H$, $H_0$, $Q$, $Q_b$ & a subgraph (the good subgraph); the graph that $H$ subdivides; the auxiliary graph; its component for the block $b$ (``component $Q_b$'', not ``block of $Q$'').\\ $\thr{t}$, $\len(t)$, $t^*$ & the thread of the edge $t$ of $H_0$; its number of edges; the special thread of the double step.\\ $\eps$ & a free edge of $H_0$. A positive real number is $\delta$.\\ $T$, $\Te$, $\Tg$ & the blue tree; red edges $+$ all $e_i$; red edges $+$ all $g_i$.\\ $N_i=\{e_i,f_i\}$, $C_i$, $s$ & the pair of the node $i$; its official cycle; the number of nodes.\\ $\HP$, $\Deps$, $H_g$ & the union of the protected threads; the cycle of the free thread; the subgraph of $H$ in the proof of Lemma~\ref{lem:P}.\\ $\Lam$, $\PL{\Lam}$, $\Lam_f$, $\pi(Y)$ & lists on the blue edges; the $A$-flows of $Q$ that avoid them; the lists of an $H$-good flow $f$; the $A$-flow of $H$ that belongs to $Y$.\\ $r$ & a running index inside a proof (never $k$).\\ $K$, $M$, $M_0$, $b_0$, $c$ & Paper~B only: the good units; the subgroup that they generate; a subset of $M$ used for averaging; the hit bound; a scale.\\ $G_F$, $F_6$ & the orientation in which the integer flow $F$ is positive; Seymour's $6$-flow.\\ $I_{\mathrm{low}}$, $I_{\mathrm{high}}$, $r(e)$ & sets of integers; the residue of an edge.\\ \hline top & an arc of size exactly $k-1$.\\ unit & an invertible element of $\Z_n$. The double move of the case $k=4p$ is the \emph{double step}; an arc of value $1$ is a \emph{$1$-arc}.\\ block & a block of a graph (graph theory). A coprime factor of $k$ is a \emph{coprime factor}.\\ protected, free & words for threads only. The ``protected moves'' of the first paper are \emph{guarded moves}.\\ frame & Definition~\ref{def:frame}: well colouring, $2$-construction and the names $e_i$, $f_i$.\\ \hline \end{longtable}} \noindent Fixed names of the shared statements: Lemma~AVG, the reverse choice, the walk lemma, Lemma~L1, Lemma~P, Lemma~L2, Theorem~M (group form), Theorem~Z (integer form), criterion~F10. All other statements have automatic numbers only. Paper~B cites Paper~A by number; Paper~A does not cite Paper~B. \section{Flows, moves and liftable steps}\label{sec:flows} Graphs are finite multigraphs with a fixed reference orientation. Loops are allowed, unless the graph is called loopless; a loop is a cycle of length~$1$. Groups are finite abelian groups. For a cycle $C$ with a direction, $\chi_C$ is its signed indicator. A \emph{$\Gam$-flow} of $G$ is a map $E(G)\to\Gam$ with conservation at every vertex; it is \emph{nowhere zero} if no value is $0$. $\Fl(G,\Gam)$ is the graph on the nowhere-zero $\Gam$-flows of $G$; two flows are adjacent if their difference is $\lambda\chi_C$ for a cycle $C$ of $G$ and $\lambda\ne 0$ (a \emph{move}). $\Mk(G)=\Fl(G,\Z_k)$. $\Ik(G)$ is the graph on the integer flows $F$ of $G$ with $1\le|F(e)|\le k-1$ for every edge $e$; two of them are adjacent if their difference is $\lambda\chi_C$ with an integer $\lambda\ne 0$. An \emph{integer lift} of a $\Z_k$-flow $f$ is a vertex $F$ of $\Ik(G)$ with $F=f$ modulo $k$. \begin{definition}[Liftable step]\label{def:liftable} Let $k\ge 3$. An element $z\ne 0$ of $\Z_k$ is \emph{liftable} if for every finite loopless multigraph $G$ and every move $f\to f+z\chi_C$ of $\Mk(G)$, all integer lifts of $f$ and all integer lifts of $f+z\chi_C$ lie in one component of $\Ik(G)$. \end{definition} \begin{lemma}[Liftable steps]\label{lem:liftable} Let $k\ge 3$ and let $G$ be a finite loopless multigraph. \begin{condlist}{(a)} \item[\textup{(a)}] Every nowhere-zero $\Z_k$-flow of $G$ has an integer lift, and all its integer lifts lie in one component of $\Ik(G)$. \item[\textup{(b)}] $1$ and $-1$ are liftable. \item[\textup{(c)}] $2$ and $-2$ are liftable. \item[\textup{(d)}] $q$ and $-q$ are liftable for every divisor $q$ of $k$ with $1\le qi$, then $C_l$ does not contain $f_i$. \textup{(}It can contain $e_i$.\textup{)} \item[\textup{(O5)}] For every abelian group $A$, every $A$-flow of $Q$ is a sum $x_1\chi_{C_1}+\dots+x_s\chi_{C_s}$ with $x_i$ in $A$, in exactly one way. \item[\textup{(O6)}] $\HP$ is connected and contains every vertex of $H$ that is not an interior vertex of a free thread; and the cycle $\Deps$ exists for every free edge $\eps$. \end{condlist} \end{lemma} \begin{definition}[Lists; $H$-good flows]\label{def:lists} Let a frame of $H$ be given. A \emph{list assignment} $\Lam$ gives every blue edge $t$ of $Q$ a set $\Lam(t)$ of elements of $A$, with $\Lam(t)$ empty for every expansion edge. $\PL{\Lam}$ is the set of the $A$-flows $Y$ of $Q$ with $Y(t)\notin\Lam(t)$ for every blue edge $t$. Let $G$ be a multigraph that contains $H$, and $f$ a nowhere-zero $\Gam$-flow of $G$ with $A$-coordinate $u$. In the case \textup{(SUB)}, $f$ is \emph{$H$-good} if $u(e)\ne 0$ for every edge $e$ of every protected thread; then \[ \Lam_f(t)=\{\,-u(e) : e\in E(\thr{t})\,\}\qquad\textup{for every original blue edge $t$.} \] So $|\Lam_f(t)|\le\len(t)$, $0$ is in $\PL{\Lam_f}$, and for an $A$-flow $Y$ of $Q$: $Y$ is in $\PL{\Lam_f}$ if and only if $u+\pi(Y)$ is non-zero on all protected threads. \textup{(}$u+\pi(Y)$ means: add $\pi(Y)$ on $E(H)$ and nothing outside $E(H)$.\textup{)} In the case \textup{(CYC)}, $f$ is \emph{$H$-good} if $u(e)\ne 0$ for every edge $e$ of $H$. \end{definition} \begin{definition}[The counts; counted frame]\label{def:counts} Let a frame of $H$ be given. The \emph{counts} for $A$ and $B$ are the following inequalities. \begin{condlist}{(C4)} \item[\Cone] $2\,\len(e_i)+\len(f_i)<|A|$ for every node $i$ \textup{(}the walk lemma\textup{)}. \item[\Ctwo] $\len(e_i)+\len(f_i)+\max\{\len(e_i),\len(f_i)\}<|A|$ for every node $i$ \textup{(}the reverse choice for a step with non-zero $A$-part\textup{)}. \item[\Cthree] $\len(e_i)+\len(f_i)+2<|A|$ for every node $i$ \textup{(}the reverse choice for a step in $B$\textup{)}. \item[\Cfour] $\len(\eps)<|B|$ for every free edge $\eps$ \textup{(}the preparation in $B$\textup{)}. \end{condlist} The frame is \emph{counted} \textup{(}for $A$ and $B$\textup{)} if \Cone--\Cfour{} hold. Two conditions on a frame that do not use the groups: \begin{condlist}{(NR)} \item[\condS] no pair $N_i$ consists of two original edges whose threads both have $3$ edges; \item[\condNR] no free thread has $3$ edges \textup{(}every original edge whose thread has $3$ edges is blue\textup{)}. \end{condlist} \end{definition} \begin{remark}\label{rem:counts} The left sides of \Cone, \Ctwo, \Cthree, \Cfour{} are at most $9$, $9$, $8$, $3$. So every frame is counted if $|A|\ge 10$ and $|B|\ge 4$. If the names are chosen with $\len(e_i)\le\len(f_i)$ for every $i$, then \Ctwo{} implies \Cone. With these names: a frame with \condS{} is counted if $|A|\ge 9$ and $|B|\ge 4$ \textup{(}left sides at most $7$, $8$, $7$, $3$\textup{)}; a frame with \condNR{} is counted if $|A|\ge 10$ and $|B|\ge 3$ \textup{(}the left side of \Cfour{} is at most $2$\textup{)}. \end{remark} \section{The lemmas of the chain}\label{sec:lemmas} In this section $\Sig$ is a step system, and a frame of $H$ is given where $H$ is a subdivision. \begin{lemma}[Reverse choice]\label{lem:reverse} Let $\Lam$ be a list assignment. \begin{condlist}{(a)} \item[\textup{(a)}] If $|\Lam(e_i)|+|\Lam(f_i)|<|A|$ for every node $i$, then for every $A$-flow $Y_0$ of $Q$ there are $x_1,\dots,x_s$ in $A$ with $Y_0+x_1\chi_{C_1}+\dots+x_s\chi_{C_s}$ in $\PL{\Lam}$. \item[\textup{(b)}] Let $E'$ be a set of red edges of $Q$, and for every $\eps$ in $E'$ let $\Phi(\eps)$ be a set of elements of $A$, not all of $A$. Let $i(\eps)$ be the least $i$ with $\eps$ on $C_i$, if there is one. If for every node $i$ \[ |\Lam(e_i)|+|\Lam(f_i)|+\sum_{\eps\in E',\ i(\eps)=i}|\Phi(\eps)|\ <\ |A|, \] then there is $Y$ in $\PL{\Lam}$ with $Y(\eps)\notin\Phi(\eps)$ for every $\eps$ in $E'$. \end{condlist} \end{lemma} \begin{lemma}[Walk lemma]\label{lem:walk} Assume \RI. Let $\Lam$ be a list assignment such that for every node $i$ \[ |\Lam(e_i)|+|\Lam(f_i)|\le 6\qquad\text{and}\qquad 2\,|\Lam(e_i)|+|\Lam(f_i)|<|A|. \] Then any two $Y$, $Y'$ in $\PL{\Lam}$ are joined by a sequence $Y=Y_0,Y_1,\dots,Y_n=Y'$ in $\PL{\Lam}$ in which every difference $Y_r-Y_{r-1}$ is $\sigma\chi_{C_l}$ with $\sigma$ in $\SigA$ and an official cycle $C_l$. In particular this holds for $\Lam=\Lam_f$ if the frame has \Cone. \end{lemma} \begin{lemma}[Lemma L1: a change of the $A$-coordinate inside $H$]\label{lem:L1} Assume \RI{} and \RII, and let the frame have \Cone{} and \Cfour. Let $G$ be a multigraph that contains $H$, $f$ an $H$-good $\Gam$-flow of $G$ with $A$-coordinate $u$, and $Y$ a flow in $\PL{\Lam_f}$. Then $f$ is $\Sig$-joined, by $\Sig$-moves on cycles of $H$, to an $H$-good flow with $A$-coordinate $u+\pi(Y)$ that is equal to $f$ outside $E(H)$. \end{lemma} \begin{lemma}[Lemma P: the path]\label{lem:P} Let $p\ne p'$ be vertices of $H$. There is a path $J$ of $H$ from $p$ to $p'$ such that, for every node $i$, at most $\max\{\len(e_i),\len(f_i)\}$ edges of $J$ lie on the threads of the edges of $N_i$ \textup{(}both threads together; so at most $3$\textup{)}. $J$ can contain any number of free threads. \end{lemma} \begin{lemma}[Lemma L2: the lift of one move of the contracted graph]\label{lem:L2} Assume $|A|\ge 8$, \RI{} and \RII. Let $G$ be a bridgeless multigraph and $H$ a subgraph of $G$ that is a cycle with at most $5$ edges \textup{(}case \textup{CYC)}, or a subdivision with a counted frame \textup{(}case \textup{SUB)}. Let $G^*=G/H$ be the multigraph obtained from $G$ by the identification of $V(H)$ to one vertex and the deletion of $E(H)$. Let $f$ be an $H$-good $\Gam$-flow of $G$ with restriction $f^*$ to $G^*$, and let $g^*=f^*+\lambda\chi_{C^*}$ be the result of a $\Sig$-move of $G^*$. Then $f$ is $\Sig$-joined to an $H$-good $\Gam$-flow $g$ of $G$ whose restriction to $G^*$ is $g^*$. \textup{(}The frame form: the same holds with \RIm{} in the place of \RI{} and, in the place of \Cone, the conclusion of Lemma~\textup{\ref{lem:L1}} for this $H$ and all $f$, $Y$.\textup{)} \end{lemma} \section{The master theorem}\label{sec:master} \begin{theorem}[Theorem M: the master theorem]\label{thm:master} Let $\Gam$ be a finite abelian group, $B$ a subgroup, $A=\Gam/B$, and $\Sig$ a step system. Assume: \begin{condlist}{(H2)} \item[\Hone] the step conditions \RI, \RII, \RIII, and the averaging condition \AVpp; \item[\Htwo] the counts: \begin{condlist}{(C0)} \item[\Czero] $|A|\ge 8$; \item[] and in \AVpp{} the good subgraph can always be chosen to be a cycle with at most $5$ edges, or a subdivision that has a counted frame, that is a frame with \Cone, \Ctwo, \Cthree, \Cfour. \end{condlist} \end{condlist} Then on every connected bridgeless multigraph $G$ \textup{(}loops allowed\textup{)} every nowhere-zero $\Gam$-flow is $\Sig$-joined to every $\Gam$-flow whose $A$-coordinate is nowhere zero. Hence any two nowhere-zero $\Gam$-flows of a bridgeless multigraph are $\Sig$-joined, and $\Fl(G,\Gam)$ is connected for every finite bridgeless multigraph $G$. \end{theorem} \begin{theorem}[Theorem M, frame form]\label{thm:masterframe} The conclusion of Theorem~\textup{\ref{thm:master}} holds also if, in \Hone, \RI{} is replaced by \RIm, and, in \Htwo, \Cone{} is replaced by \begin{condlist}{(L1)} \item[\condLone] the conclusion of Lemma~\textup{\ref{lem:L1}} holds for the subdivisions $H$ and the frames of \Htwo, for every multigraph $G$ that contains $H$. \end{condlist} \textup{(}\RI{} for six deleted elements and \Cone{} are used only in the walk lemma, and the walk lemma is used only in Lemma~\textup{\ref{lem:L1}}.\textup{)} \end{theorem} \begin{remark}[Where the deletions are used]\label{rem:deletions} \RI: the walk lemma deletes at most $\len(e_i)+\len(f_i)\le 6$ elements of $A$; the case CYC of Lemma~\ref{lem:L2} and the end of the proof of Theorem~\ref{thm:master} in the case CYC delete at most $5$. \RII: the preparation in $B$ \textup{(}Lemma~\ref{lem:L1}, and Lemma~\ref{lem:L2} for a step with non-zero $A$-part\textup{)} deletes at most $\len(\eps)-1\le 2$ elements of $B$; the end of the proof uses only that $\SigB$ generates $B$. \RIII{} is used for loops only. \Czero{} is the count $5+2<|A|$ of the case CYC; the target flow needs $|A|\ge 6$. \end{remark} \begin{corollary}[Corollary (i): no condition on the colouring]\label{cor:i} Let $|A|\ge 10$ and $|B|\ge 4$, and let $\Sig$ be a step system with \RI, \RII, \RIII{} and \AVpp. Then the conclusion of Theorem~\textup{\ref{thm:master}} holds. \end{corollary} \begin{corollary}[Corollary (ii): quotient of order $9$, condition \condS]\label{cor:ii} Let $|A|\ge 9$ and $|B|\ge 4$, and let $\Sig$ be a step system with \RI, \RII, \RIII{} and with \AVpp{} in this form: the good subgraph can always be chosen to be a cycle with at most $5$ edges, or a subdivision that has a frame with \condS. Then the conclusion of Theorem~\textup{\ref{thm:master}} holds. \end{corollary} \begin{corollary}[Corollary (iii): subgroup of order $3$, condition \condNR]\label{cor:iii} Let $|A|\ge 10$ and $|B|=3$, and let $\Sig$ be a step system with \RI, \RII, \RIII{} and with \AVpp{} in this form: the good subgraph can always be chosen to be a cycle with at most $5$ edges, or a subdivision that has a frame with \condNR. Then the conclusion of Theorem~\textup{\ref{thm:master}} holds. \end{corollary} \begin{remark}\label{rem:open} Corollaries~\ref{cor:ii} and~\ref{cor:iii} are conditional. No statement of the two papers says that a frame with \condS, or a frame with \condNR, exists for every subdivision that the averaging step gives. So they give no new modulus and no new group as they stand \textup{(}the open cases are $k=36$ and $k=30$\textup{)}. \end{remark} \begin{theorem}[Theorem Z: the integer form]\label{thm:Z} Let $k=ab$ with integers $a,b\ge 2$, $\Gam=\Z_k$, $B=a\Z_k$ \textup{(}the multiples of $a$; $b$ elements\textup{)} and $A=\Z_a$ \textup{(}reduction modulo $a$\textup{)}. Let $\Sig$ be a step system all of whose elements are liftable, and let $\Gam$, $B$, $\Sig$ satisfy the hypotheses of Theorem~\textup{\ref{thm:master}} or of Theorem~\textup{\ref{thm:masterframe}}. Then \begin{condlist}{(a)} \item[\textup{(a)}] $\Mk(G)$ is connected for every finite bridgeless multigraph $G$ \textup{(}loops allowed\textup{)}; \item[\textup{(b)}] $\Ik(G)$ is connected for every finite bridgeless loopless multigraph $G$. \end{condlist} \end{theorem} \section{The bases and the group theorem}\label{sec:bases} \begin{criterion}[Criterion F10]\label{crit:F10} Let $k$ be not a prime power, and $k=ab$ with $a\ge 10$ and a composite number $b\ge 4$. Let $D$ be the set of the non-zero residues modulo $a$ of $\pm 1$, $\pm 2$ and $\pm q$, for all divisors $q$ of $k$ with $1\le q