Related papers: Symmetric Tensor Matroids, Dual Rigidity Matroids,…
Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.
We study the realization spaces of matroids and hyperplane arrangements. First, we define the notion of naive dimension for the realization space of matroids and compare it with the expected dimension and the algebraic dimension, exploring…
The singleton and doubleton minors of a polymatroid $\rho$ encode a surprising amount of information about the structural complexity of $\rho$. Given any polymatroid $\rho$, we can subtract from it a maximally-separated polymatroid,…
Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…
We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…
This paper defines the q-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a q-matroid, and why they are (not) cryptomorphic. Also, we explain the…
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
In the Inverse Matroid problem, we are given a matroid, a fixed basis $B$, and an initial weight function, and the goal is to minimally modify the weights -- measured by some function -- so that $B$ becomes a maximum-weight basis. The…
A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwell's counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the…
A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…
Two naturally occurring matroids representable over Q are shown to be dual: the {\it cyclotomic matroid} $\mu_n$ represented by the $n^{th}$ roots of unity $1,\zeta,\zeta^2,...,\zeta^{n-1}$ inside the cyclotomic extension $Q(\zeta)$, and a…
A set function can be extended to the unit cube in various ways; the correlation gap measures the ratio between two natural extensions. This quantity has been identified as the performance guarantee in a range of approximation algorithms…
Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to…
This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…
Let $V$ be a vector space of rectangular $n\times k$ matrices annihilating the Cullis' determinant. We show that $\dim(V) \le (n-1)k$, extending Dieudonn{\'{e}}'s result on the dimension of vector spaces of square matrices annihilating the…
Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…
In this note we discuss the classification of duality orbits of N = 8 gauged supergravity models. Using tensor classifiers, we show that there is a one-parameter family of inequivalent SO(8) gauged supergravity theories. We briefly discuss…
A matroid is uniform if and only if it has no minor isomorphic to $U_{1,1}\oplus U_{0,1}$ and is paving if and only if it has no minor isomorphic to $U_{2,2}\oplus U_{0,1}$. This paper considers, more generally, when a matroid $M$ has no…
In 1980 Lov\'{a}sz introduced the concept of a double circuit in a matroid. The 2nd, 3rd and 4th authors recently generalised this notion to $k$-fold circuits (for any natural number $k$) and proved foundational results about these $k$-fold…
We revisit anomalies of $(4,0)$ and $(3,1)$ maximally supersymmetric tensor theories in $d=6$. A $(4,0)$ on-shell tensor multiplet descends to that of the $d=5$ maximal supergravity upon a dimensional reduction, hypothesized to offer a…