Improved computation of involutive bases
From MaRDI portal
Publication:2829991
Abstract: In this paper, we describe improved algorithms to compute Janet and Pommaret bases. To this end, based on the method proposed by Moller et al., we present a more efficient variant of Gerdt's algorithm (than the algorithm presented by Gerdt-Hashemi-M.Alizadeh) to compute minimal involutive bases. Further, by using the involutive version of Hilbert driven technique, along with the new variant of Gerdt's algorithm, we modify the algorithm, given by Seiler, to compute a linear change of coordinates for a given homogeneous ideal so that the new ideal (after performing this change) possesses a finite Pommaret basis. All the proposed algorithms have been implemented in Maple and their efficiency is discussed via a set of benchmark polynomials.
Recommendations
Cites work
- scientific article; zbMATH DE number 1574478 (Why is no real title available?)
- scientific article; zbMATH DE number 1684370 (Why is no real title available?)
- scientific article; zbMATH DE number 3649988 (Why is no real title available?)
- scientific article; zbMATH DE number 3651027 (Why is no real title available?)
- scientific article; zbMATH DE number 1263375 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type
- A combinatorial approach to involution and \(\delta \)-regularity. II: Structure analysis of polynomial modules with Pommaret bases
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A new framework for computing Gröbner bases
- A new incremental algorithm for computing Groebner bases
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Hilbert functions and the Buchberger algorithm
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Involution. The formal theory of differential equations and its applications in computer algebra
- Involutive bases algorithm incorporating F\(_5\) criterion
- Involutive bases of polynomial ideals
- Monomial Ideals
- On an installation of Buchberger's algorithm
Cited in
(12)- An improved heuristic for computing short integral cycle bases
- Recursive structures in involutive bases theory
- An involutive GVW algorithm and the computation of Pommaret bases
- Deterministic genericity for polynomial ideals
- Improved Arithmetic of Complex Fans
- Toward involutive bases over effective rings
- Detecting unnecessary reductions in an involutive basis computation
- Janet bases and resolutions in \textsc{CoCoALib}
- On selection of nonmultiplicative prolongations in computation of Janet bases
- scientific article; zbMATH DE number 1684371 (Why is no real title available?)
- Computation of Pommaret bases using syzygies
- scientific article; zbMATH DE number 1574478 (Why is no real title available?)
This page was built for publication: Improved computation of involutive bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829991)
