Switching-and-scaling equivalence conjecture for canonical gain-graph matrices

Let F\mathbb{F} be a field, let GG be a loopless graph with orientation DD, and let ψ\psi and ψ\psi' be (F+F×)(\mathbb{F}^+\rtimes \mathbb{F}^{\times})-gain functions for GG. Suppose that

M(F+F×,F+,A,G,ψ)=M(F+F×,F+,A,G,ψ)M(\mathbb{F}^+ \rtimes \mathbb{F}^{\times}, \mathbb{F}^+, \mathcal{A}, G, \psi)=M(\mathbb{F}^+ \rtimes \mathbb{F}^{\times}, \mathbb{F}^+, \mathcal{A}, G, \psi')

and that this matroid is 33-connected and has rank at least 33. The gain functions are switching-and-scaling equivalent if one can be obtained from the other by a sequence of vertex switchings and scalings. Canonical matrix equivalence conjecture. The matrices A(D,ψ)A(D,\psi) and A(D,ψ)A(D,\psi') are projectively equivalent if and only if ψ\psi and ψ\psi' are switching-and-scaling equivalent. This would extend the known frame and lifted-graphic special cases; the loopless, connectivity, and rank hypotheses are stated to be necessary.

Sources & referencesView supporting material

Primary source

Zach Walsh, “Matroids from gain graphs over quotient groups”, arXiv:2602.23066 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.