Computing inhomogeneous Gröbner bases

DOI10.1016/j.jsc.2010.10.002zbMath1252.13018arXiv0901.1105OpenAlexW2035438310MaRDI QIDQ633077

Anna Maria 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

Gröbner basesBuchberger's algorithm

Mathematics Subject Classification ID

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

Related Items

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

Uses Software

• CoCoA
• slimgb

Cites Work

• Hilbert functions and the Buchberger algorithm
• On the cancellation rule in the homogenization
• On an installation of Buchberger's algorithm
• The geobucket data structure for polynomials
• Computing toric ideals
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficiently computing minimal sets of critical pairs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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