Related papers: The joints problem for matroids
We present two characterizations of regular matroids among orientable matroids and use them to give a measure of "how far" an orientable matroid is from being regular.
We study how good a lexicographically maximal solution is in the weighted matching and matroid intersection problems. A solution is lexicographically maximal if it takes as many heaviest elements as possible, and subject to this, it takes…
We give a formula for the number of interior intersection points made by the diagonals of a regular $n$-gon. The answer is a polynomial on each residue class modulo 2520. We also compute the number of regions formed by the diagonals, by…
The width of a delta-matroid is the difference in size between a maximal and minimal feasible set. We give a Rough Structure Theorem for delta-matroids that admit a twist of width one. We apply this theorem to give an excluded minor…
For integer $n>0$, let $f(n)$ be the number of rows of the largest all-0 or all-1 square submatrix of $M$, minimized over all $n\times n$ $0/1$-matrices $M$. Thus $f(n)= O(\log n)$. But let us fix a matrix $H$, and define $f_H(n)$ to be the…
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…
For a set of matroids $\mathcal{M}$, let $ex_\mathcal{M}(n)$ be the maximum size of a simple rank-$n$ matroid in $\mathcal{M}$. We prove that, for any finite field $\mathbb{F}$, if $\mathcal{M}$ is a minor-closed class of…
In this article, we introduce the parametric matroid $\ell$-interdiction problem, where $\ell\in\mathbb{N}_{>0}$ is a fixed number of elements allowed to be interdicted. Each element of the matroid's ground set is assigned a weight that…
A theory of single-element extensions of integer polymatroids analogous to that of matroids is developed. We present an algorithm to generate a catalog of $2$-polymatroids, up to isomorphism. When we implemented this algorithm on a…
We give a self-contained proof of the strongest version of Mason's conjecture, namely that for any matroid the sequence of the number of independent sets of given sizes is ultra log-concave. To do this, we introduce a class of polynomials,…
We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…
We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…
In this paper we investigate the number of integer points lying in dilations of lattice path matroid polytopes. We give a characterization of such points as polygonal paths in the diagram of the lattice path matroid. Furthermore, we prove…
In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…
An 'induced restriction' of a simple binary matroid $M$ is a restriction $M|F$, where $F$ is a flat of $M$. We consider the class $\mathcal{M}$ of all simple binary matroids $M$ containing neither a free matroid on three elements (which we…
The minimum number of elements needed for a poset to have exactly n linear extensions is at most 2sqrt{n}. In a special case, the bound can be improved to sqrt{n}.
We show how a direct application of Shearers' Lemma gives an almost optimum bound on the number of matroids on $n$ elements.
Given two matroids $\mathcal{M}_1$ and $\mathcal{M}_2$ over the same ground set, the matroid intersection problem is to find the maximum cardinality common independent set. In the weighted version of the problem, the goal is to find a…
We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.
The primary aim of this paper is to establish bounds on the joint spectral radius for a finite set of nonnegative matrices based on their diagonal elements. The efficacy of this approach is evaluated in comparison to existing and related…