Detecting unnecessary reductions in an involutive basis computation

DOI10.1016/j.jsc.2004.04.004zbMath1120.13028OpenAlexW2093299949MaRDI QIDQ2456593

Joachim Apel, Ralf Hemmecke

Publication date: 19 October 2007

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2004.04.004

zbMATH Keywords

Gröbner basisinvolutive basisBuchberger criteriainvolutive criteria

Mathematics Subject Classification ID

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

Related Items (9)

Involutive method for computing Gröbner bases over \(\mathbb F_2\) ⋮ Role of involutive criteria in computing Boolean Gröbner bases ⋮ Sufficient set of integrability conditions of an orthonomic system ⋮ Effectiveness of involutive criteria in computation of polynomial Janet bases ⋮ Algorithmic Thomas decomposition of algebraic and differential systems ⋮ Involutive bases algorithm incorporating F\(_5\) criterion ⋮ Thomas Decomposition of Algebraic and Differential Systems ⋮ Parallel computation of Janet and Gröbner bases over rational numbers ⋮ A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type

Cites Work

• Non-commutative Gröbner bases in algebras of solvable type
• An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras
• On an installation of Buchberger's algorithm
• The theory of involutive divisions and an application to Hilbert function computations
• Involutive bases of polynomial ideals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Detecting unnecessary reductions in an involutive basis computation