English

Minimal Generating Sets of Lattice Ideals

Commutative Algebra 2017-01-23 v4 Combinatorics

Abstract

Let LZnL\subset \mathbb{Z}^n be a lattice and IL=xuxv: uvLI_L=\langle x^{\bf u}-x^{\bf v}:\ {\bf u}-{\bf v}\in L\rangle be the corresponding lattice ideal in k[x1,,xn]\Bbbk[x_1,\ldots, x_n], where k\Bbbk is a field. In this paper we describe minimal binomial generating sets of ILI_L and their invariants. We use as a main tool a graph construction on equivalence classes of fibers of ILI_L. As one application of the theory developed we characterize binomial complete intersection lattice ideals, a longstanding open problem in the case of non-positive lattices.

Keywords

Cite

@article{arxiv.1303.2303,
  title  = {Minimal Generating Sets of Lattice Ideals},
  author = {Hara Charalambous and Apostolos Thoma and Marius Vladoiu},
  journal= {arXiv preprint arXiv:1303.2303},
  year   = {2017}
}

Comments

v4: the title is changed, a few proofs simplified and one example added (Example 4.9); to appear in Collectanea Math

R2 v1 2026-06-21T23:39:29.744Z