Computing generating sets of lattice ideals

Simple item page
dc.creatorHemmecke, Raymond
dc.creatorMalkin, Peter
dc.date2005-08-19
dc.date2006-05-12
dc.date.accessioned2026-07-07T06:42:48Z
dc.date.available2026-07-07T06:42:48Z
dc.descriptionIn 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.
dc.descriptionThe manuscript has been rearranged and modified to improve presentation and readability of the project-and-lift algorithm to compute generating sets of lattice ideals
dc.identifierhttps://arxiv.org/abs/math/0508359
dc.identifierhttp://arxiv.org/abs/math/0508359
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102179
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.titleComputing generating sets of lattice ideals
dc.typetext

Files

Collections

arXiv