Delphi.science

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

Source: hexagonmath.org/abs/2611.00522v1

Dave Goel

Hexagonhexagon/2611.00522Nov 16, 2026math.COAI-generatedscore 0

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…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00522
curl -X POST /api/v1/records/hexagon/2611.00522/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00522/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'