Related papers: On robustness and related properties on toric idea…
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…
A homogeneous ideal is robust if its universal Gr\"obner basis is also a minimal generating set. For toric ideals, one has the stronger definition: A toric ideal is strongly robust if its Graver basis equals the set of indispensable…
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…
A numerical semigroup is said to be universally free if it is free for any possible arrangement of its minimal generating set. In this work, we establish that toric ideals associated with universally free numerical semigroups can be…
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…
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…
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…
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…
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…
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 \subseteq R = \mathbb{K}[x_1,\ldots,x_n]$ be a toric ideal, i.e., a binomial prime ideal. We investigate when the ideal $I$ can be "split" into the sum of two smaller toric ideals. For a general toric ideal $I$, we give a sufficient…
Characteristic imsets are 0-1 vectors which correspond to Markov equivalence classes of directed acyclic graphs. The study of their convex hull, named the characteristic imset polytope, has led to new and interesting geometric perspectives…
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…
We classify the finite connected simple graphs whose edge rings are strongly Koszul. From the classification, it follows that if the edge ring is strongly Koszul, then its toric ideal possesses a quadratic Gr\"obner basis.
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results…
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs…