Stanley-Reisner rings and the radicals of lattice ideals
Abstract
In this article we associate to every lattice ideal IL,⊂ K[x1,..., xm] a cone σ and a graph Gσ with vertices the minimal generators of the Stanley-Reisner ideal of σ . To every polynomial F we assign a subgraph Gσ(F) of the graph Gσ. Every expression of the radical of IL,, as a radical of an ideal generated by some polynomials F1,..., Fs gives a spanning subgraph of Gσ, the i=1s Gσ(Fi). This result provides a lower bound for the minimal number of generators of IL, and therefore improves the generalized Krull's principal ideal theorem for lattice ideals. But mainly it provides lower bounds for the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Finally we show, by a family of examples, that the bounds given are sharp.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.