Related papers: Tverberg-type theorems for matroids: A counterexam…

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Schubert varieties of hyperplane arrangements, also known as matroid Schubert varieties, play an essential role in the proof of the Dowling-Wilson conjecture and in Kazhdan-Lusztig theory for matroids. We study these varieties as…

$q,t$-deformed matrix models give rise to representations of the deformed Virasoro algebra and more generally of the quantum toroidal $\mathfrak{gl}_1$ algebra. These representations are described in terms of finite difference equations…

In [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with…

Polymatroids are combinatorial abstractions of subspace arrangements in the same way that matroids are combinatorial abstractions of hyperplane arrangements. By introducing augmented Chow rings of polymatroids, modeled after augmented…

Consider a linear realization of a matroid over a field. One associates with it a configuration polynomial and a symmetric bilinear form with linear homogeneous coefficients. The corresponding configuration hypersurface and its non-smooth…

For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…

The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…

This paper is a direct generalization of Baker-Bowler theory to flag matroids, including its moduli interpretation as developed by Baker and the second author for matroids. More explicitly, we extend the notion of flag matroids to flag…

We show that a simple rank-$r$ matroid with no $(t+1)$-element independent flat has at least as many elements as the matroid $M_{r,t}$ defined as the direct sum of $t$ binary projective geometries whose ranks pairwise differ by at most $1$.…

This is a revised version of our original paper (arXiv:1808.00489v2) incorporating the corrections published in a corrigendum (arXiv:1808.00489v3). Our main theorem as originally stated was missing the required assumption that matroids…

We prove that given any $\theta_1,\ldots,\theta_{2d-2}\in \R\setminus\Z$, the support of the bifurcation measure of the moduli space of degree $d$ rational maps coincides with the closure of classes of maps having $2d-2$ neutral cycles of…

In this article we make several contributions of independent interest. First, we introduce the notion of stressed hyperplane of a matroid, essentially a type of cyclic flat that permits to transition from a given matroid into another with…

We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag varieties. We introduce two different generalizations, and demonstrate that each has its own merits, where the trade-off is between the ease…

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic…

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

Seymour's Splitter Theorem is a basic inductive tool for dealing with $3$-connected matroids. This paper proves a generalization of that theorem for the class of $2$-polymatroids. Such structures include matroids, and they model both sets…

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…