Matroids from gain graphs over quotient groups
Abstract
We present a new construction for matroids from gain graphs that simultaneously generalizes several existing constructions. The construction takes as input a gain graph over a Frobenius group with Frobenius kernel and outputs an elementary lift of the frame matroid of the underlying gain graph over the quotient group . While the hypothesis that is a Frobenius group may seem unusual, we prove that it is in some sense necessary: if is any finite group with a nontrivial proper normal subgroup and there is a construction that takes in a complete -gain graph and outputs an elementary lift of the frame matroid of the underlying -gain graph so that a cycle of the graph is a circuit of if and only if it is -balanced, then is a Frobenius group with Frobenius kernel .
Cite
@article{arxiv.2602.23066,
title = {Matroids from gain graphs over quotient groups},
author = {Zach Walsh},
journal= {arXiv preprint arXiv:2602.23066},
year = {2026}
}