Related papers: On the intersection conjecture for infinite trees …
One of the most important questions in matroid optimization is to find disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list of conjectures that can be formulated as special cases.…
We propose a geometric and categorical approach to the Hodge Conjecture for all smooth projective complex varieties. By embedding any such variety into a flat family with general fibers smooth complete intersections, we prove the conjecture…
Building on our earlier work on toric residues and reduction, we give a proof for the mixed toric residue conejecture of Batyrev and Materov. We simplify and streamline our technique of tropical degenerations, which allows one to…
A tangle of order $k$ in a matroid or graph may be thought of as a "$k$-connected component". For a tangle of order $k$ in a matroid or graph that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or…
In this paper, we prove the existence portion of the Bertram-Feinberg-Mukai Conjecture for an infinite family of new cases using degeneration technique. This not only leads to a substantial improvement of known results but also develops…
A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…
We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…
The McCarty Conjecture states that any McCarty Matrix (an $n\times n$ matrix $A$ with positive integer entries and each of the $2n$ row and column sums equal to $n$), can be additively decomposed into two other matrices, $B$ and $C$, such…
We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…
We provide evidence for five long-standing, basis-exchange conjectures for matroids by proving them for the enormous class of sparse paving matroids. We also explore the role that these matroids may play in the following problem: as a…
A matroid is sticky if any two of its extensions by disjoint sets can be glued together along the common restriction (that is, they have an amalgam). The sticky matroid conjecture asserts that a matroid is sticky if and only if it is…
In this article we study the (cohomological) Hodge conjecture for singular varieties. We prove the conjecture for simple normal crossing varieties that can be embedded in a family where the Mumford-Tate group remains constant. We show how…
We give simpler algebraic proofs of uniqueness for several Erd\H{o}s-Ko-Rado results, i.e., that the canonically intersecting families are the only largest intersecting families. Using these techniques, we characterize the largest partially…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
Let $M$ be a matroid and let $Q$, $R$, $S$ and $T$ be subsets of the ground set such that the smallest separation that separates $Q$ from $R$ has order $k$ and the smallest separation that separates $S$ from $T$ has order $l$. We prove that…
Let $M$ be a representable matroid, and $Q, R, S, T$ subsets of the ground set. We prove that, if $M$ is sufficiently large, then there is an element $e$ such that deleting or contracting $e$ preserves both the $Q$-$R$ and the $S$-$T$…
This paper investigates infinite matroids from a categorical perspective. We prove that the category of infinite matroids is a proto-exact category in the sense of Dyckerhoff and Kapranov, thereby generalizing our previous result on the…
Oxley conjectured (1992) that if a matroid has a circuit-cocircuit intersection of size $k\ge4$, it has a circuit-cocircuit intersection of size $k-2$. We show that this conjecture holds for $k\le6$.
In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by…
We discuss recent progress many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.