Computing generating sets of lattice ideals

2005/08/19 by Hemmecke, Raymond, Malkin, Peter
#Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.math/0508359

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.

Related

• An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes
• On finite generating sets of infinitely generated ideals
• Explicit Deformation of Lattice Ideals via Chip Firing Games on Directed Graphs
• A Combinatorial Algorithm to Find the Minimal Free Resolution of an Ideal with Binomial and Monomial Generators
• Lifting multiplicative lattices to ideal sytems