English
Related papers

Related papers: Enumerating Matroids and Linear Spaces

200 papers

Let $r \leqslant n$ be nonnegative integers, and let $N = \binom{n}{r} - 1$. For a matroid $M$ of rank $r$ on the finite set $E = [n]$ and a partial field $k$ in the sense of Semple--Whittle, it is known that the following are equivalent:…

Combinatorics · Mathematics 2024-01-02 Matthew Baker , Tong Jin

We prove that the number of single element extensions of $M(K_{n+1})$ is $2^{{n\choose n/2}(1+o(1))}$. This is done using a characterization of extensions as "linear subclasses".

Combinatorics · Mathematics 2021-11-15 Peter Nelson , Shayla Redlin , Jorn van der Pol

We define Chern numbers of a matroid. These numbers are obtained when intersecting appropriate matroid Chern-Schwartz-MacPherson cycles defined by L\'opez de Medrano, Rinc\'on, and Shaw. We prove that when a matroid arises from a complex…

Combinatorics · Mathematics 2023-10-18 Eline Mannino

To determine whether an $n\times n$-matrix has rank at most $r$ it suffices to check that the $(r+1)\times (r+1)$-minors have rank at most $r$. In other words, to describe the set of $n\times n$-matrices with the property of having rank at…

Algebraic Geometry · Mathematics 2024-06-14 Andreas Blatter

We show that, if $k$ and $\ell$ are positive integers and $r$ is sufficiently large, then the number of rank-$k$ flats in a rank-$r$ matroid $M$ with no $U_{2,\ell+2}$-minor is less than or equal to number of rank-$k$ flats in a rank-$r$…

Combinatorics · Mathematics 2013-09-18 Peter Nelson

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

We study the relationship between a q-analogue of matroids and linear codes with the rank metric in the vector space of matrices with entries in a finite field. We prove a Greene type identity for the rank generating function of these…

Combinatorics · Mathematics 2018-03-19 Keisuke Shiromoto

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Combinatorics · Mathematics 2025-03-31 Masato Konoike , Koji Matsushita

Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…

Combinatorics · Mathematics 2023-07-27 Tianyi Zhang , Justin Chen

Fix an integer $r\geq 3$. We consider metric spaces on $n$ points such that the distance between any two points lies in $\{1,..., r\}$. Our main result describes their approximate structure for large $n$. As a consequence, we show that the…

Combinatorics · Mathematics 2015-02-10 Dhruv Mubayi , Caroline Terry

We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…

Combinatorics · Mathematics 2025-06-10 Emiliano Liwski , Fatemeh Mohammadi , Lisa Vandebrouck

Let $\mathcal B=\mathcal B_{k,n,p}$ be a random collection of $k$-subsets of $[n]$ where each possible set is present independently with probability $p$. Let $\cal E_{\mathcal B}$ be the event that $\mathcal B$ defines the set of bases of a…

Combinatorics · Mathematics 2026-05-11 Patrick Bennett , Alan Frieze

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

Combinatorics · Mathematics 2014-10-29 Jim Geelen , Peter Nelson

In this article, we study polymatroids that are representable by means of linear restricted rank-metric codes, namely, by subspaces of the space of alternating, symmetric, or Hermitian square matrices endowed with the rank metric. More…

Combinatorics · Mathematics 2026-02-20 Eimear Byrne , Giovanni Longobardi , and Rocco Trombetti

We provide a formula for the Ehrhart polynomial of the connected matroid of size $n$ and rank $k$ with the least number of bases, also known as a minimal matroid. We prove that their polytopes are Ehrhart positive and $h^*$-real-rooted (and…

Combinatorics · Mathematics 2021-06-17 Luis Ferroni

Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…

Combinatorics · Mathematics 2021-11-08 Hiroyuki Miyata

Given $n$ subspaces of a finite-dimensional vector space over a fixed finite field $\mathbb F$, we wish to find a "branch-decomposition" of these subspaces of width at most $k$ that is a subcubic tree $T$ with $n$ leaves mapped bijectively…

Discrete Mathematics · Computer Science 2022-10-05 Jisu Jeong , Eun Jung Kim , Sang-il Oum

For an integer $n\geq 7$, we investigate the matroid realization space of a specific deformation of the regular $n$-gon along with its lines of symmetry. It turns out that this particular realization space is birational to the elliptic…

Algebraic Geometry · Mathematics 2025-12-08 Lukas Kühne , Xavier Roulleau

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

Combinatorics · Mathematics 2025-08-15 Mamadou Mostapha Kanté , Eun Jung Kim , O-joung Kwon , Sang-il Oum

Given an arbitrary (commutative) field K, let V be a linear subspace of M_n(K) consisting of matrices of rank lesser than or equal to some r<n. A theorem of Atkinson and Lloyd states that, if dim V>nr-r+1 and #K>r, then either all the…

Rings and Algebras · Mathematics 2013-03-05 Clément de Seguins Pazzis