Practical Groebner Basis Computation

2012/06/29 by Bjarke Hammersholt Roune, Roune, Bjarke Hammersholt, Michael Stillman +1
Computer Science · Mathematics · #Commutative Algebra (math.AC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Symbolic Computation (cs.SC) #cs.DS #cs.SC #math.AC

paper · pdf · doi:10.48550/arxiv.1206.6940

Full online version including appendices, 17 pages; Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2012

arxiv created 2012/06/29 · arxiv updated 2012/07/02

Abstract

We report on our experiences exploring state of the art Groebner 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 Groebner 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.

Related

• Simple signature-based Groebner basis algorithm
• Improving incremental signature-based Groebner basis algorithms
• An efficient reduction strategy for signature-based algorithms to compute Groebner basis
• Signature-Based Gröbner Basis Algorithms --- Extended MMM Algorithm for computing Gröbner bases
• A survey on signature-based Gröbner basis computations