相关论文: Improved bounds for Rota's Basis Conjecture

We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…

The way circuits, relative to a basis, are affected as a result of exchanging a basis element, is studied. As consequences, it is shown that three consecutive symmetric exchanges exist for any two bases of a matroid, and that a full serial…

We prove that the ranks of the subsets and the activities of the bases of a matroid define valuations for the subdivisions of a matroid polytope into smaller matroid polytopes.

Las Vergnas Cube Conjecture states that the cube matroid has exactly one class of orientations. We prove that this conjecture is equivalent to saying that the oriented matroid of the affine dependencies of the n-cube can be reconstructed…

It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…

We prove that for each finite field $\mathbb F$ and integer $k\in \mathbb Z$ there exists $n\in \mathbb Z$ such that no excluded minor for the class of $\mathbb F$-representable matroids has $n$ nested $k$-separations.

We prove an asymptotic saturation-type version of Rota's basis conjecture. It relies on the connection of Tao's slice rank with unstable tensors from geometric invariant theory.

Let A be an m \times n matrix in which the entries of each row are all distinct. Drisko showed that, if m \ge 2n-1, then A has a transversal: a set of n distinct entries with no two in the same row or column. We generalize this to matrices…

We prove that linear extensions of the Bruhat order of a matroid are shelling orders and that the barycentric subdivision of a matroid is a Coxeter matroid, viewing barycentric subdivisions as subsets of a parabolic quotient of a symmetric…

In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…

The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We…

For a simplicial complex ${\mathcal C}$ denote by $\beta({\mathcal C})$ the minimal number of edges from ${\mathcal C}$ needed to cover the ground set. If ${\mathcal C}$ is a matroid then for every partition $A_1, \ldots, A_m$ of the ground…

We show that if a knot or link has n thin levels when put in thin position then its exterior contains a collection of n disjoint, non-parallel, planar, meridional, essential surfaces. A corollary is that there are at least n/3 tetrahedra in…

We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity…

Huang, McKinnon, and Satriano conjectured that if $v \in \mathbb{R}^n$ has distinct coordinates and $n \geq 3$, then a hyperplane through the origin other than $\sum_i x_i = 0$ contains at most $2\lfloor n/2 \rfloor (n-2)!$ of the vectors…

Suppose that for some unit vectors $b_1,\ldots b_n$ in $\mathbb C^d$ we have that for any $j\neq k$ $b_j$ is either orthogonal to $b_k$ or $|\langle b_j,b_k\rangle|^2 = 1/d$ (i.e. $b_j$ and $b_k$ are unbiased). We prove that if $n=d(d+1)$,…

Recently, it was proved by B\'erczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically intractable. On the other hand, many special cases were…

In 1993, Csima and Sawyer proved that in a non-pencil arrangement of n pseudolines, there are at least $\frac{6}{13}n$ simple points of intersection. Since pseudoline arrangements are the topological representations of reorientation classes…

This paper introduces Dirichlet matroids, a generalization of graphic matroids arising from electrical networks. We present four main theorems. First, we exhibit a matroid quotient involving geometric duals of networks embedded in surfaces…

We show that, under suitable hypotheses, the foundation of a generalized parallel connection of matroids is the relative tensor product of the foundations. Using this result, we show that the foundation of a 2-sum of matroids is the…