Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge
Commutative Algebra
2007-05-23 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.math/0508287,
title = {Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge},
author = {Niels Lauritzen},
journal= {arXiv preprint arXiv:math/0508287},
year = {2007}
}