Practical Gröbner basis computation

DOI10.1145/2442829.2442860MaRDI QIDQ5244536zbMATH OpenOpenAlexFDO

Authors Bjarke Hammersholt Roune, Mike Stillman

Publication date 27 March 2015

Published in Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.6940

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

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.

Recommendations

• Computation of Gröbner bases
• Computing Gröbner Bases within Linear Algebra
• Computing a structured Gröbner basis approximately
• scientific article; zbMATH DE number 2042790
• An efficient method for computing comprehensive Gröbner bases
• A new framework for computing Gröbner bases
• scientific article; zbMATH DE number 1163421
• scientific article; zbMATH DE number 4137921
• Computer Aided Systems Theory – EUROCAST 2005
• scientific article; zbMATH DE number 1263330

Cited in

(31)

• Syzygies probing scattering amplitudes
• A survey on signature-based algorithms for computing Gröbner bases
• Speeding up the GVW algorithm via a substituting method
• Slimgb: Gröbner bases with slim polynomials
• Termination of the F5 algorithm
• A generic and executable formalization of signature-based Gröbner basis algorithms
• Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
• An analysis of inhomogeneous signature-based Gröbner basis computations
• Computation of difference Gröbner bases
• Simple signature based iterative algorithm for calculation of Gröbner bases
• Giac and GeoGebra -- improved Gröbner basis computations
• Computing Gröbner bases associated with lattices
• A new framework for computing Gröbner bases
• Effective computation of strong Gröbner bases over Euclidean domains
• scientific article; zbMATH DE number 1262464 (Why is no real title available?)
• scientific article; zbMATH DE number 2151244 (Why is no real title available?)
• Computation of Gröbner bases
• Signature-based algorithms to compute Gröbner bases
• Computing a structured Gröbner basis approximately
• An improvement over the GVW algorithm for inhomogeneous polynomial systems
• scientific article; zbMATH DE number 5192687 (Why is no real title available?)
• FGb: A Library for Computing Gröbner Bases
• STABILITY COMPUTATION VIA GROBNER BASIS
• A signature-based algorithm for computing the nondegenerate locus of a polynomial system
• Axioms for a theory of signature bases
• On the computation of Gröbner bases for matrix-weighted homogeneous systems
• An Hilbert-driven strategy for signature-based Gröbner basis algorithms
• Exploring the geometric buchberger algorithm in integer programming
• Integer programming with binary and bounded variables via Gröbner bases with applications to multiobjective integer programming
• Signature-Based Gröbner Basis Algorithms
• A signature-based algorithm for computing Gröbner bases over principal ideal domains

Describes a project that uses

Uses Software

• Macaulay2

This page was built for publication: Practical Gröbner basis computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244536)