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 1 and outputs an elementary lift of the frame matroid of the underlying gain graph over the quotient group /1. 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 1 and there is a construction that takes in a complete -gain graph and outputs an elementary lift M of the frame matroid of the underlying (/1)-gain graph so that a cycle of the graph is a circuit of M if and only if it is -balanced, then is a Frobenius group with Frobenius kernel 1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…