Let IL, ρ be a lattice ideal. We provide a necessary and sufficient criterion under which a set
of binomials in IL, ρ generates the radical of IL, ρ up to radical. We apply our results to the …

ARITHMETICAL RANK OF TORIC IDEALS ASSOCIATED TO GRAPHS 1. Introduction Let G
be a finite, connected and undirected graph having Page 1 PROCEEDINGS OF THE …

Using a generalized notion of matching in a simplicial complex and circuits of vector
configurations, we compute lower bounds for the minimum number of generators, the …

In this article, we study specializations of multigradings and apply them to the problem of the
computation of the arithmetical rank of a lattice ideal IL 𝒢⊂ K [x 1,…, xn]. The arithmetical …

We show that for all n⩾ 3 and all primes p there are infinitely many simplicial toric varieties of
codimension n in the 2n-dimensional affine space whose minimum number of defining …

To any lattice $ L\subset\mathbb {Z}^{m} $ one can associate the lattice ideal $ I_ {L}\subset
K [x_ {1},..., x_ {m}] $. This paper concerns the study of the relation between the binomial …