Related papers: Strongly robust toric ideals in codimension 2

An ideal I is robust if its universal Gr\"obner basis is a minimal generating set for this ideal. In this paper, we generalize the meaning of robust ideals. An ideal is defined as generalized robust if its universal Gr\"obner basis is equal…

Let I be a toric ideal. We say I is robust if its universal Groebner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely…

We call an ideal in a polynomial ring robust if it can be minimally generated by a universal Gr\"obner basis. In this paper we show that robust toric ideals generated by quadrics are essentially determinantal. We then discuss two possible…

A toric ideal is called robust if its universal Gr\"obner basis is a minimal set of generators, and is called generalized robust if its universal Gr\"obner basis equals its universal Markov basis (the union of all its minimal sets of…

Strongly robust toric ideals are the toric ideals for which the set of indispensable binomials is the Graver basis. The strongly robust simplicial complex $\Delta _T$ of a simple toric ideal $I_T$ determines the strongly robust property for…

We describe explicitly all multisets of weights whose defining projective toric varieties are self-dual. In addition, we describe a remarkable and unexpected combinatorial behaviour of the defining ideals of these varieties. The toric ideal…

In this article, we investigate the strongly robust property of toric ideals associated with weighted oriented graphs. We establish that the toric ideals of a broad class of monomial ideals are strongly robust; this class encompasses the…

To every toric ideal one can associate an oriented matroid structure, consisting of a graph and another toric ideal, called bouquet ideal. The connected components of this graph are called bouquets. Bouquets are of three types; free, mixed…

Every normal toric ideal of codimension two is minimally generated by a Grobner basis with squarefree initial monomials. A polynomial time algorithm is presented for checking whether a toric ideal of fixed codimension is normal.

In this work, we study the equivalence of various robustness properties of toric ideals of weighted oriented graphs. For any weighted oriented graph $D$, if its toric ideal $I_D$ is generalized robust (or weakly robust), then we show that…

The universal Gr\"{o}bner basis of $I$, is a Gr\"{o}bner basis for $I$ with respect to all term orders simultaneously. Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the elements of the universal…

Describing families of ideals that are minimally generated by at least one, or by all, of their reduced Gr\"obner bases is a central topic in commutative algebra. In this paper, we address this problem in the context of toric ideals of…

Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…

In this paper, we discuss the normality of the toric rings of stable set polytopes, and the set of generators and Gr\"obner bases of toric ideals of stable set polytopes by using the results on that of edge polytopes of finite nonsimple…

We prove that the defining ideal of a sufficiently high Veronese subring of a toric algebra admits a quadratic Gr\"obner basis consisting of binomials. More generally, we prove that the defining ideal of a sufficiently high Veronese subring…

To any toric ideal $I_A$, encoded by an integer matrix $A$, we associate a matroid structure called {\em the bouquet graph} of $A$ and introduce another toric ideal called {\em the bouquet ideal} of $A$. We show how these objects capture…

Extending the notion of indispensable binomials of a toric ideal, we define indispensable monomials of a toric ideal and establish some of their properties. They are useful for searching indispensable binomials of a toric ideal and for…

Let $G$ be a simple graph on the vertex set $\{1,\ldots,n\}$ with $m$ edges. An algebraic object attached to $G$ is the ideal $P_{G}$ generated by diagonal 2-minors of an $n \times n$ matrix of variables. In this paper we prove that if $G$…

A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…

Let I be the toric ideal defined by a 2 x n matrix of integers, A = ((1 1 ... 1)(a_1 a_2 ... a_n)) with a_1<a_2<...<a_n. We give a combinatorial proof that I is generated by elements of degree at most the sum of the two largest differences…