Related papers: The excluded minors for $k$-polymatroids with bina…
Halin proved that every minimally $k$-connected graph has a vertex of degree $k$. More generally, does every minimally vertically $k$-connected matroid have a $k$-element cocircuit? Results of Murty and Wong give an affirmative answer when…
We study a class of determinantal ideals arising from conditional independence (CI) statements with hidden variables. Such CI statements translate into determinantal conditions on a matrix whose entries represent the probabilities of events…
An excluded minor characterization for the class of binary signed-graphic matroids with graphic cocircuits is provided. In this report we present the necessary computations for the case analysis in the proof.
We study pure ordered simplicial complexes (i.e., simplicial complexes with a linear order on their ground sets) from the Hopf-theoretic point of view. We define a \textit{Hopf class} to be a family of pure ordered simplicial complexes that…
We conjecture that the class of frame matroids can be characterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bicircular matroids. The proof does not…
We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type $B_d$. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension $d$ whose…
For a set of matroids $\mathcal{M}$, let $ex_\mathcal{M}(n)$ be the maximum size of a simple rank-$n$ matroid in $\mathcal{M}$. We prove that, for any finite field $\mathbb{F}$, if $\mathcal{M}$ is a minor-closed class of…
Every gammoid is a minor of an excluded minor for the class of gammoids.
An 'induced restriction' of a simple binary matroid $M$ is a restriction $M|F$, where $F$ is a flat of $M$. We consider the class $\mathcal{M}$ of all simple binary matroids $M$ containing neither a free matroid on three elements (which we…
A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for…
Let $\cM$ be a minor-closed class of matroids that does not contain arbitrarily long lines. The growth rate function, $h:\bN\rightarrow \bN$ of $\cM$ is given by $$h(n) = \max(|M|\, : \, M\in \cM, simple, rank-$n$).$$ The Growth Rate…
We contribute to the classification of modular categories $\mathcal{C}$ with $\operatorname{FPdim}(\mathcal{C})\equiv 2 \pmod 4$. We prove that such categories have group of invertibles of even order, and that they factorize as $\mathcal…
Fix an integer $d \geq 2$. The space $\mathcal{P}_{d}$ of polynomial maps of degree $d$ modulo conjugation by affine transformations is naturally an affine variety over $\mathbb{Q}$ of dimension $d -1$. For each integer $P \geq 1$, the…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
A $d$-dimensional closed convex set $K$ in $\mathbb{R}^d$ is said to be lattice-free if the interior of $K$ is disjoint with $\mathbb{Z}^d$. We consider the following two families of lattice-free polytopes: the family $\mathcal{L}^d$ of…
We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising…
We prove that for every poset $P$, there is a constant $C$ such that the size of any family of subsets of $[n]$ that does not contain $P$ as an induced subposet is at most $C{\binom{n}{\lfloor\frac{n}{2}\rfloor}}$, settling a conjecture of…
The class of cographs or complement-reducible graphs is the class of graphs that can be generated from $K_1$ using the operations of disjoint union and complementation. By analogy, this paper introduces the class of binary comatroids as the…
A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can be seen as a matroidal generalization of a biased graph. We…
This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…