Related papers: Matroid toric ideals: complete intersection, minor…
Let $A=\{{\bf a}_1,...,{\bf a}_m\} \subset \mathbb{Z}^n$ be a vector configuration and $I_A \subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of…
Describing minimal generating set of a toric ideal is a well-studied and difficult problem. In 1980 White conjectured that the toric ideal associated to a matroid is equal to the ideal generated by quadratic binomials corresponding to…
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…
Let $a, b$ and $n > 1$ be three positive integers such that $a$ and $\sum_{j=0}^{n-1} b^j$ are relatively prime. In this paper, we prove that the toric ideal $I$ associated to the submonoid of $\mathbb{N}$ generated by $\{\sum_{j=0}^{n-1}…
In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of {\em triangles}, for a matroid to have either $U_{2,4}$ or $F_7$ or $M(K_5)$ as a minor.
In 1980, White conjectured that the toric ideal of a matroid is generated by quadratic binomials corresponding to a symmetric exchange. In this paper, we compute Gr\"obner bases of toric ideals associated with matroids and show that, for…
In 1980, White conjectured that the toric ideal associated to a matroid is generated by binomials corresponding to a symmetric exchange. In this paper, we prove that classes of matroids for which the toric ideal is generated by quadrics and…
Given a set $\mathcal A = \{a_1,\ldots,a_n\} \subset \mathbb{N}^m$ of nonzero vectors defining a simplicial toric ideal $I_{\mathcal A} \subset k[x_1,...,x_n]$, where $k$ is an arbitrary field, we provide an algorithm for checking whether…
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…
This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…
We study the algebraic matroid induced by the ideal of (r+1)-minors of a matrix of variables over a field. This is inherently connected to the bounded-rank matrix completion problem, in which the aim is to complete a partially observed rank…
In this paper, we deal with the problem of uniqueness of minimal system of binomial generators of a semigroup ideal. Concretely, we give different necessary and/or sufficient conditions for uniqueness of such minimal system of generators.…
A matroid $M$ is an ordered pair $(E,I)$, where $E$ is a finite set called the ground set and a collection $I\subset 2^{E}$ called the independent sets which satisfy the conditions: (i) $\emptyset \in I$, (ii) $I'\subset I \in I$ implies…
Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes…
We give a description of the minimal primes of the ideal generated by the 2 x 2 adjacent minors of a generic matrix. We also compute the complete prime decomposition of the ideal of adjacent m x m minors of an m x n generic matrix when the…
We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most…
Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that the toric ideal associated to a matroid is generated by quadrics corresponding to single element symmetric…
For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem…
In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…
In this paper, we provide a combinatorial characterization of those collections of cells whose inner $2$-minor ideals are complete intersections. More precisely, given a collection of cells $\mathcal C$ and its associated inner $2$-minor…