Improved Computation of Involutive Bases

DOI10.1007/978-3-319-45641-6_5zbMath1453.13074arXiv1705.03441OpenAlexW2516133070MaRDI QIDQ2829991

Amir Hashemi, Werner M. Seiler, Bentolhoda Binaei

Publication date: 9 November 2016

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

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)

Related Items (1)

Deterministic genericity for polynomial ideals

Uses Software

• Maple

Cites Work

• Hilbert functions and the Buchberger algorithm
• Involution. The formal theory of differential equations and its applications in computer algebra
• 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
• On an installation of Buchberger's algorithm
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Involutive bases of polynomial ideals
• Involutive bases algorithm incorporating F\(_5\) criterion
• 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 incremental algorithm for computing Groebner bases
• A new framework for computing Gröbner bases
• Monomial Ideals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved Computation of Involutive Bases