Improved Computation of Involutive Bases

DOI10.1007/978-3-319-45641-6_5zbMATH Open1453.13074arXiv1705.03441OpenAlexW2516133070MaRDI QIDQ2829991FDOQ2829991

Amir Hashemi, Werner M. Seiler, Bentolhoda Binaei

Publication date: 9 November 2016

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

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.

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Involutive bases of polynomial ideals
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• A new incremental algorithm for computing Groebner bases
• Monomial Ideals
• Involution. The formal theory of differential equations and its applications in computer algebra
• 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
• A new framework for computing Gröbner bases
• On an installation of Buchberger's algorithm
• Hilbert functions and the Buchberger algorithm
• A combinatorial approach to involution and \(\delta \)-regularity. II: Structure analysis of polynomial modules with Pommaret bases
• A combinatorial approach to involution and \(\delta \)-regularity. I: Involutive bases in polynomial algebras of solvable type
• Involutive bases algorithm incorporating F\(_5\) criterion

Cited In (7)

• Deterministic genericity for polynomial ideals
• Title not available (Why is that?)
• An improved heuristic for computing short integral cycle bases
• Title not available (Why is that?)
• Improved Arithmetic of Complex Fans
• Recursive structures in involutive bases theory
• Detecting unnecessary reductions in an involutive basis computation

Uses Software

• Maple

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)