Computing generating sets of lattice ideals
Combinatorics
2007-05-23 v2 Commutative Algebra
Abstract
In this article, we present a new algorithm for computing a generating set of a lattice ideal. This algorithm is based on a project-and-lift approach and is implemented in 4ti2. We also include a computational comparison of several existing implementations to compute such generating sets.
Keywords
Cite
@article{arxiv.math/0508359,
title = {Computing generating sets of lattice ideals},
author = {Raymond Hemmecke and Peter Malkin},
journal= {arXiv preprint arXiv:math/0508359},
year = {2007}
}
Comments
The manuscript has been rearranged and modified to improve presentation and readability of the project-and-lift algorithm to compute generating sets of lattice ideals