Related papers: Reconfiguring Ordered Bases of a Matroid

In this work, we study sequential contracts under matroid constraints. In the sequential setting, an agent can take actions one by one. After each action, the agent observes the stochastic value of the action and then decides which action…

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…

For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…

We study dynamic algorithms for maintaining fundamental algebraic properties of matrices, specifically, rank, basis, and full-rank submatrices, with applications to maximum matching on dynamic graphs. Prior dynamic algorithms for rank…

Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…

A theory of single-element extensions of integer polymatroids analogous to that of matroids is developed. We present an algorithm to generate a catalog of $2$-polymatroids, up to isomorphism. When we implemented this algorithm on a…

Let $V$ denote a vector space with finite positive dimension. We consider a pair of linear transformations $A : V \to V$ and $A^* : V \to V$ that satisfy (i) and (ii) below: (i) There exists a basis for $V$ with respect to which the matrix…

The eigenproblem of low-rank updated matrices are of crucial importance in many applications. Recently, an upper bound on the number of distinct eigenvalues of a perturbed matrix was established. The result can be applied to estimate the…

We design an FPRAS to count the number of bases of any matroid given by an independent set oracle, and to estimate the partition function of the random cluster model of any matroid in the regime where $0<q<1$. Consequently, we can sample…

Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system ${\mathcal I}$ given that we want an approximation guarantee only for sets in a prescribed ${\mathcal O}\subseteq {\mathcal I}$. This…

Given two matroids $\mathcal{M}_{1} = (E, \mathcal{B}_{1})$ and $\mathcal{M}_{2} = (E, \mathcal{B}_{2})$ on a common ground set $E$ with base sets $\mathcal{B}_{1}$ and $\mathcal{B}_{2}$, some integer $k \in \mathbb{N}$, and two cost…

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 introduce a logical framework for the specification and verification of component-based systems, in which finitely many component instances are active, but the bound on their number is not known. Besides specifying and verifying…

The main ingredient to construct an O-border basis of an ideal I $\subseteq$ K[x1,. .., xn] is the order ideal O, which is a basis of the K-vector space K[x1,. .., xn]/I. In this paper we give a procedure to find all the possible order…

In $1980$ White conjectured that every element of the toric ideal of a matroid is generated by quadratic binomials corresponding to symmetric exchanges. We prove White's conjecture for high degrees with respect to the rank. This extends our…

Rota's Basis Conjecture is a well known problem from matroid theory, that states that for any collection of $n$ bases in a rank $n$ matroid, it is possible to decompose all the elements into $n$ disjoint rainbow bases. Here an asymptotic…

This paper develops matroidal analogues of classical results on matchings in abelian groups. By embedding matroid ground sets in an abelian group, we introduce base matchings between matroid bases, recover the group-theoretic setting in the…

If V(R) is the vertex sequence of a symmetric cycle R in the tope graph of a simple acyclic oriented matroid M on a t-element ground set, then the set min V(R) of minimal elements in the subposet V(R) of the tope poset of M, based at the…

We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matroid with limited violations of the other ones. On top of the…

The reconfiguration problem for homomorphisms of digraphs to a reflexive digraph cycle, which amounts to deciding if a `reconfiguration graph' is connected, is known to by polynomially time solvable via a greedy algorithm based on certain…