Computing inhomogeneous Gröbner bases

DOI10.1016/J.JSC.2010.10.002zbMATH Open1252.13018OpenAlexW2035438310MaRDI QIDQ633077FDOQ633077

Authors Anna M. Bigatti, Massimo Caboara, Lorenzo Robbiano 

Publication date 31 March 2011

Published in Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

Buchberger's algorithmGröbner bases

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Abstract: In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.

Recommendations

• An analysis of inhomogeneous signature-based Gröbner basis computations
• scientific article; zbMATH DE number 1273640
• Asymmetric approach to computation of Gröbner bases
• On an installation of Buchberger's algorithm
• scientific article; zbMATH DE number 177861

Cites Work

• scientific article; zbMATH DE number 3649988 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 1254277 (Why is no real title available?)
• scientific article; zbMATH DE number 1273640 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Computing toric ideals
• Efficiently computing minimal sets of critical pairs
• Hilbert functions and the Buchberger algorithm
• On an installation of Buchberger's algorithm
• On the cancellation rule in the homogenization
• The geobucket data structure for polynomials

Cited In (7)

• Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms.
• An analysis of inhomogeneous signature-based Gröbner basis computations
• On affine tropical F5 algorithms
• Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
• A lattice formulation of the noncommutative \(F_4\) procedure
• Computation of difference Gröbner bases
• Gröbner bases and gradings for partial difference ideals

Uses Software

• CoCoA
• slimgb

This page was built for publication: Computing inhomogeneous Gröbner bases

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