Practical Gröbner basis computation

Authors:
Bjarke Hammersholt Roune;Michael Stillman
Affiliations:
Cornell University, Ithaca;Cornell University, Ithaca
Venue:
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Year:
2012

Citing 7
Cited 1

The geobucket data structure for polynomials

Journal of Symbolic Computation
Two Simplified Algorithms for Maintaining Order in a List

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Comparing the speed of programs for sparse polynomial multiplication

ACM SIGSAM Bulletin
Computing irredundant irreducible decompositions of large scale monomial ideals

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
The F5 criterion revised

Journal of Symbolic Computation
Polynomial division using dynamic arrays, heaps, and packed exponent vectors

CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing

Signature rewriting in gröbner basis computation

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report on our experiences exploring state of the art Gröbner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature based Gröbner basis algorithms and more traditional variations of the classic Buchberger algorithm. Our conclusions are based on experiments using our new freely available open source standalone C++ library.