A parallel Buchberger algorithm for multigraded ideals
Commutative Algebra
2011-05-30 v1 Distributed, Parallel, and Cluster Computing
Symbolic Computation
Abstract
We demonstrate a method to parallelize the computation of a Gr\"obner basis for a homogenous ideal in a multigraded polynomial ring. Our method uses anti-chains in the lattice to separate mutually independent S-polynomials for reduction.
Keywords
Cite
@article{arxiv.1105.5509,
title = {A parallel Buchberger algorithm for multigraded ideals},
author = {Mikael Vejdemo-Johansson and Emil Sköldberg and Jason Dusek},
journal= {arXiv preprint arXiv:1105.5509},
year = {2011}
}
Comments
8 pages, 6 figures