English
Related papers

Related papers: Representation of matroids

200 papers

Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P' of P. We say that B confines M to P' if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, and oriented matroids. We call the resulting objects matroids over hyperfields. In fact, there are (at least)…

Combinatorics · Mathematics 2017-04-21 Matthew Baker , Nathan Bowler

We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…

Combinatorics · Mathematics 2025-08-13 Tong Jin , Donggyu Kim

We provide a new axiom system for flag matroids, characterize representability of uniform flag matroids, and give forbidden minor characterizations of full flag matroids that are representable over $\mathbb{F}_2$ and $\mathbb{F}_3$ along…

Combinatorics · Mathematics 2026-04-15 Daniel Irving Bernstein , Nathaniel Vaduthala

We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it geometrically…

Combinatorics · Mathematics 2015-09-16 S. R. Kingan

We study the algebraic matroid induced by the ideal of (r+1)-minors of a matrix of variables over a field. This is inherently connected to the bounded-rank matrix completion problem, in which the aim is to complete a partially observed rank…

Commutative Algebra · Mathematics 2026-01-09 Lisa Nicklasson , Manolis C. Tsakiris

We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…

Combinatorics · Mathematics 2025-02-24 Michael Bamiloshin , Oriol Farràs , Carles Padró

This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…

Combinatorics · Mathematics 2013-12-16 Franz J. Király , Zvi Rosen , Louis Theran

We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…

Combinatorics · Mathematics 2012-02-01 Zur Izhakian , John Rhodes

We study the representability problem for torsion-free arithmetic matroids. By using a new operation called "reduction" and a "signed Hermite normal form", we provide and implement an algorithm to compute all the representations, up to…

Combinatorics · Mathematics 2023-03-08 Roberto Pagaria , Giovanni Paolini

A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…

Combinatorics · Mathematics 2019-09-11 Austin Alderete

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R=$\mathbb{Z}$, and when R is a DVR, we get…

Combinatorics · Mathematics 2019-11-19 Alex Fink , Luca Moci

It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…

Combinatorics · Mathematics 2011-01-26 Jim Geelen , Geoff Whittle

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

Combinatorics · Mathematics 2007-09-10 Dillon Mayhew

We show that the algebraic rank of divisors on certain graphs is related to the realizability problem of matroids. As a consequence, we produce a series of examples in which the algebraic rank depends on the ground field. We use the theory…

Algebraic Geometry · Mathematics 2020-12-16 Yoav Len

We show that each algebraic representation of a matroid $M$ in positive characteristic determines a matroid valuation of $M$, which we have named the {\em Lindstr\"om valuation}. If this valuation is trivial, then a linear representation of…

Combinatorics · Mathematics 2017-11-23 Guus Bollen , Jan Draisma , Rudi Pendavingh

We present a new direct proof of a topological representation theorem for oriented matroids in the general rank case. Our proof is based on an earlier rank 3 version. It uses hyperline sequences and the generalized Sch{\"o}nflies theorem.…

Combinatorics · Mathematics 2007-05-23 Juergen Bokowski , Simon King , Susanne Mock , Ileana Streinu

A $q$-matroid is the analogue of a matroid which arises by replacing the finite ground set of a matroid with a finite-dimensional vector space over a finite field. These $q$-matroids are motivated by coding theory as the representable…

Combinatorics · Mathematics 2025-11-27 Sebastian Degen , Lukas Kühne

The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…

Combinatorics · Mathematics 2020-08-04 Matthew Baker , Oliver Lorscheid

The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Pl\"ucker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a…

Combinatorics · Mathematics 2019-10-03 Matthias Lenz