Related papers: The structure of $I_4$-free and triangle-free bina…

Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k>=0, decides…

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

It is well known that in q-matroids, axioms for independent spaces, bases, and spanning spaces differ from the classical case of matroids, since the straightforward q-analogue of the classical axioms does not give a q-matroid. For this…

In this paper we study algebraic sets of pairs of matrices defined by the vanishing of either the diagonal of their commutator matrix or its anti-diagonal. We find a system of parameters for the coordinate rings of these two sets and their…

In their 2008 paper Gau and Wu conjectured that the numerical range of a 4-by-4 nilpotent matrix has at most two flat portions on its boundary. We prove this conjecture, establishing along the way some additional facts of independent…

We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…

For a matroid with an ordered (or "labelled") basis, a basis exchange step removes one element with label $l$ and replaces it by a new element that results in a new basis, and with the new element assigned label $l$. We prove that one…

For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…

We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if…

One of the most intriguing unsolved questions of matroid optimization is the characterization of the existence of $k$ disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list of conjectures…

Motivated by many practical applications, in this paper we study {\em budget feasible mechanisms} where the goal is to procure independent sets from matroids. More specifically, we are given a matroid $\mathcal{M}=(E,\mathcal{I})$ where…

We study a particular graded ring structure on the set of all loopfree matroids on a fixed labeled ground set, which occurs naturally in tropical geometry. The product is given by matroid intersection and the additive structure is defined…

A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…

Given an integer $d \ge 2$, what is the least $r$ so that there is a set of binary quadratic forms $\{f_1,\dots,f_r\}$ for which $\{f_j^d\}$ is non-trivially linearly dependent? We show that if $r \le 4$, then $d \le 5$, and for $d \ge 4$,…

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…

Let $P(M)$ be the matroid base polytope of a matroid $M$. A {\em matroid base polytope decomposition} of $P(M)$ is a decomposition of the form $P(M) = \bigcup\limits_{i=1}^t P(M_{i})$ where each $P(M_i)$ is also a matroid base polytope for…

Let $A\to B$ be a morphism of Artin local rings with the same embedding dimension. We prove that any $A$-flat $B$-module is $B$-flat. This freeness criterion was conjectured by de Smit in 1997 and improves Diamond's Theorem 2.1 from his…