Involutive division techniques: some generalizations and optimizations
From MaRDI portal
Abstract: In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them allows one to compute an involutive Groebner basis of a polynomial ideal by sequentially examining multiplicative reductions of nonmultiplicative prolongations. We study dependence of involutive algorithms on the completion ordering. Based on properties of particular involutive divisions two computational optimizations are suggested. One of them consists in a special choice of the completion ordering. Another optimization is related to recomputing multiplicative and nonmultiplicative variables in the course of the algorithm.
Recommendations
Cited in
(9)- The theory of involutive divisions and an application to Hilbert function computations
- On an algorithmic optimization in computation of involutive bases
- On constructivity of involutive divisions
- Parallel algorithms for Gröbner-basis construction
- Involutive divisions: Slice and pair properties
- Involutive division generated by an antigraded monomial ordering
- Involutive directions and new involutive divisions
- Involutive divisions and monomial orderings
- Asymmetric approach to computation of Gröbner bases
This page was built for publication: Involutive division techniques: some generalizations and optimizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959715)