{"paper":{"title":"Minimal Generating Sets of Lattice Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Apostolos Thoma, Hara Charalambous, Marius Vladoiu","submitted_at":"2013-03-10T09:59:02Z","abstract_excerpt":"Let $L\\subset \\mathbb{Z}^n$ be a lattice and $I_L=\\langle x^{\\bf u}-x^{\\bf v}:\\ {\\bf u}-{\\bf v}\\in L\\rangle$ be the corresponding lattice ideal in $\\Bbbk[x_1,\\ldots, x_n]$, where $\\Bbbk$ is a field. In this paper we describe minimal binomial generating sets of $I_L$ and their invariants. We use as a main tool a graph construction on equivalence classes of fibers of $I_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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2303","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}