English

Matroids from gain graphs over quotient groups

Combinatorics 2026-02-27 v1 Group Theory

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 Γ\Gamma with Frobenius kernel Γ1\Gamma_1 and outputs an elementary lift of the frame matroid of the underlying gain graph over the quotient group Γ/Γ1\Gamma/\Gamma_1. While the hypothesis that Γ\Gamma is a Frobenius group may seem unusual, we prove that it is in some sense necessary: if Γ\Gamma is any finite group with a nontrivial proper normal subgroup Γ1\Gamma_1 and there is a construction that takes in a complete Γ\Gamma-gain graph and outputs an elementary lift MM of the frame matroid of the underlying (Γ/Γ1)(\Gamma/\Gamma_1)-gain graph so that a cycle of the graph is a circuit of MM if and only if it is Γ\Gamma-balanced, then Γ\Gamma is a Frobenius group with Frobenius kernel Γ1\Gamma_1.

Keywords

Cite

@article{arxiv.2602.23066,
  title  = {Matroids from gain graphs over quotient groups},
  author = {Zach Walsh},
  journal= {arXiv preprint arXiv:2602.23066},
  year   = {2026}
}
R2 v1 2026-07-01T10:53:59.687Z