Switching-and-scaling equivalence conjecture for canonical gain-graph matrices
Switching-and-scaling equivalence conjecture for canonical gain-graph matrices
Let be a field, let be a loopless graph with orientation , and let and be -gain functions for . Suppose that
and that this matroid is -connected and has rank at least . 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 and are projectively equivalent if and only if and 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.