A parallel Buchberger algorithm for multigraded ideals
classification
🧮 math.AC
cs.DCcs.SC
keywords
methodmultigradedalgorithmanti-chainsbasisbuchbergercomputationdemonstrate
read the original 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 $\mathbb N^k$ to separate mutually independent S-polynomials for reduction.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.