Related papers: Counting matroids in minor-closed classes
We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…
This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…
We study covers of the multiplicative group of an algebraically closed field as quasiminimal pregeometry structures and prove that they satisfy the axioms for Zariski-like structures presented in \cite{lisuriart}, section 4. These axioms…
In this article we classify quadruple Galois canonical covers of smooth surfaces of minimal degree. The classification shows that they are either non-simple cyclic covers or bi-double covers. If they are bi-double then they are all fiber…
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…
A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erd\H{o}s in 1950, and over the following decades he asked many questions about them. Most…
It has been conjectured that sparse paving matroids will eventually predominate in any asymptotic enumeration of matroids, i.e. that $\lim_{n\rightarrow\infty} s_n/m_n = 1$, where $m_n$ denotes the number of matroids on $n$ elements, and…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
Let ${\bf A}={\bf A}_{n,m,k}$ be a random $n\times m$ matrix over $\mathbf{GF}_2$ wher each column consists of $k$ randomly chosen ones. Let $M$ be an arbirary fixed binary matroid. We show that if $m/n$ and $k$ are sufficiently large then…
The configuration of a matroid $M$ is the abstract lattice of cyclic flats (flats that are unions of circuits) where we record the size and rank of each cyclic flat, but not the set. One can compute the Tutte polynomial of $M$, and stronger…
We consider a finite-dimensional vector space $W\subset K^E$ over an arbitrary field $K$ and an arbitrary set $E$. We show that the set $C(W)\subset 2^E$ consisting of the minimal supports of $W$ are the circuits of a matroid on $E$. In…
We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…
A super-minimally $k$-connected matroid is a $k$-connected matroid having no proper $k$-connected restriction of size at least $2k-2$. This extends the corresponding concept for graphs. For $k=2$ and $k=3$, we determine the maximum size of…
Las Vergnas and Hamidoune studied the number of circuits needed to determine an oriented matroid. In this paper we investigate this problem and some new variants, as well as their interpretation in particular classes of matroids. We present…
A lattice path matroid is a transversal matroid for which some collection of incomparable intervals in some linear order on the ground set is a presentation. We characterize the minor-closed class of lattice path matroids by its excluded…
One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
We prove that the class of numerable open covers of topological spaces is the smallest class that contains covers with pairwise disjoint elements and numerable covers with two elements, closed under composition and coarsening of covers. We…