Minimal Generating Sets of Lattice Ideals
Commutative Algebra
2017-01-23 v4 Combinatorics
Abstract
Let be a lattice and be the corresponding lattice ideal in , where is a field. In this paper we describe minimal binomial generating sets of and their invariants. We use as a main tool a graph construction on equivalence classes of fibers of . 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.
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