Matroid lifts and representability
From MaRDI portal
Abstract: A 1965 result of Crapo shows that every elementary lift of a matroid can be constructed from a linear class of circuits of . In a recent paper, Walsh generalized this construction by defining a rank- lift of a matroid given a rank- matroid on the set of circuits of , and conjectured that all matroid lifts can be obtained in this way. In this sequel paper we simplify Walsh's construction and show that this conjecture is true for representable matroids but is false in general. This gives a new way to certify that a particular matroid is non-representable, which we use to construct new classes of non-representable matroids. Walsh also applied the new matroid lift construction to gain graphs over the additive group of a non-prime finite field, generalizing a construction of Zaslavsky for these special groups. He conjectured that this construction is possible on three or more vertices only for the additive group of a non-prime finite field. We show that this conjecture holds for four or more vertices, but fails for exactly three.
Recommendations
- scientific article; zbMATH DE number 3487529
- scientific article; zbMATH DE number 3080938
- scientific article; zbMATH DE number 3407754
- Eine Bemerkung zum Satz von Vitali über Konvergenz von Funktionenfolgen: Dem stets hilftsbereiten Herrn Kollegen H. L. Schmid, gewidmet
- scientific article; zbMATH DE number 1839786
- Holomorphic mappings of complex manifolds
- scientific article; zbMATH DE number 5593209
- On \(\varepsilon\)-representations
- scientific article; zbMATH DE number 3148394
Cites work
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A new matroid lift construction and an application to group-labeled graphs
- Biased graphs. II: The three matroids
- Combinatorial derived matroids
- Dependencies among dependencies in matroids
- Doubly exponentially many ingleton matroids
- Non‐Algebraic Matroids exist
- Partitionen endlicher Gruppen
- Partitions and other coverings of finite groups.
- Single-element extensions of matroids
- The circuit basis in binary matroids
- Theory of Matroids
- When does a biased graph come from a group labelling?
This page was built for publication: Matroid lifts and representability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6117419)