Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge

2005/08/16 by Niels Lauritzen, Lauritzen, Niels · 1 citation
Computer Science · Engineering · Mathematics · #Commutative Algebra and Its Applications #Polynomial and algebraic computation #graph theory and CDMA systems #math.AC #math.CO #msc:13P10

paper · pdf · doi:10.48550/arxiv.math/0508287

arxiv created 2005/08/16 · arxiv updated 2009/12/01

Abstract

We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.

Cited by

• Truncated Groebner fans and lattice ideals

Related

• The Buchberger resolution
• A parallel Buchberger algorithm for multigraded ideals
• Combinatorial commutative algebra rules
• Extended letterplace correspondence for nongraded noncommutative ideals\n and related algorithms
• Computing generating sets of lattice ideals