Related papers: Normal Toric Ideals of Low Codimension
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…
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…
The toric ideal of a $d$-dimensional flow polytope has an initial ideal generated by square-free monomials of degree at most $d$. The toric ideal of a flow polytope of dimension at most four has an initial ideal generated by square-free…
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…
In this paper, we study a class of toric ideals obtained by using some geometric data of ADE trees which are the minimal resolution graphs of rational surface singularities. We compute explicit Gr\"obner bases for these toric ideals that…
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$…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
Let X be a complete toric variety with homogeneous coordinate ring S. In this article, we compute upper and lower bounds for the codimension in the critical degree of ideals of S generated by dim(X)+1 homogeneous polynomials that don't…
Let I be the toric ideal of a homogeneous normal configuration. We prove that I is generated by circuits if and only if each unbalanced circuit of I has a "connector" which is a linear combination of circuits with a square-free term. In…
In this paper, we study toric ideals generated by circuits. For toric ideals which have squarefree quadratic initial ideals, a sufficient condition to be generated by circuits is given. In particular, squarefree Veronese subrings, the…
We consider the phylogenetic tree model in which every node of the tree is observed and binary and the transitions are given by the same matrix on each edge of the tree. We are able to compute the Grobner basis and Markov basis of the toric…
Hara, Takemura and Yoshida discuss toric ideals arising from two way subtable sum problems and shows that these toric ideals are generated by quadratic binomials if and only if the subtables are either diagonal or triangular. In the present…
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…
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…
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…
It is shown that up to dimension four, the toric ideal of a quiver polytope is generated in degree two, with the only exception of the four-dimensional Birkhoff polytope. As a consequence, B{\o}gvad's conjecture holds for quiver polytopes…
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…
We propose an effective algorithm that decides if a prime ideal in a polynomial ring over the complex numbers can be transformed into a toric ideal by a linear automorphism of the ambient space. If this is the case, the algorithm computes…
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…
This paper provides a formula for the Mather-Jacobian multiplier ideals of torus invariant ideals on (not necessarily normal) toric varieties that generalizes Howald's formula for the multiplier ideal of monomial ideals in a polynomial…