Related papers: The Weak-Map Order and Polytopal Decompositions of…

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…

Let $P(M)$ be the matroid base polytope of a matroid $M$. A {\em matroid base polytope decomposition} of $P(M)$ is a decomposition of the form $P(M) = \bigcup\limits_{i=1}^t P(M_{i})$ where each $P(M_i)$ is also a matroid base polytope for…

This is a continuation of the early paper concerning matroid base polytope decomposition. Here, we will present sufficient conditions on $M$ so its base matroid polytope $P(M)$ has a {\em sequence} of hyperplane splits. The latter yields to…

Let $M$ to be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. In this paper, we prove that the nontrivial facets…

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…

We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…

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…

The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

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…

The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…

For a discrete poset $\mathcal X$ McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$ from the order complex to the poset equipped with the Up topology is a weak homotopy equivalence. Much later, Zivaljevi\'{c} defined the…

A simple binary matroid is called claw-free if none of its rank-3 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $\mathrm{PG}(n-1,2)$ for which $|E \cap P|$ is not a basis of $P$ for any…

Let M to be a matroid defined on a finite set E. A subset L of E is locked in M if L is 2-connected in M, the complement of L is 2-connected in the dual M*, and min{r(L), r*(complement of L)} is greater than 1. In this paper, we prove that…

Let $\cX$ be a family of subsets of a finite set $E$. A matroid on $E$ is called an $\cX$-matroid if each set in $\cX$ is a circuit. We consider the problem of determining when there exists a unique maximal $\cX$-matroid in the weak order…

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

In this article, we investigate the multi-parametric matroid problem. The weights of the elements of the matroid's ground set depend linearly on an arbitrary but fixed number of parameters, each of which is taken from a real interval. The…

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…