Effectiveness of involutive criteria in computation of polynomial Janet bases

DOI10.1134/S0361768806030030MaRDI QIDQ2433010zbMATH OpenFDO

Authors Vladimir Gerdt, D. A. Yanovich

Publication date 26 October 2006

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0361768806030030

Mathematics Subject Classification ID

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

Recommendations

• Detecting unnecessary reductions in an involutive basis computation
• On selection of nonmultiplicative prolongations in computation of Janet bases
• scientific article; zbMATH DE number 1684371
• Involutive bases of polynomial ideals
• Recursive structures in involutive bases theory

Cites work

• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Detecting unnecessary reductions in an involutive basis computation
• scientific article; zbMATH DE number 1684371 (Why is no real title available?)
• scientific article; zbMATH DE number 5052246 (Why is no real title available?)
• Involutive bases of polynomial ideals
• Involutive divisions of monomials
• The theory of involutive divisions and an application to Hilbert function computations

Cited in

(6)

• Involutive bases algorithm incorporating F\(_5\) criterion
• Thomas decomposition of algebraic and differential systems
• Algorithmic Thomas decomposition of algebraic and differential systems
• Involutive method for computing Gröbner bases over \(\mathbb F_2\)
• Role of involutive criteria in computing Boolean Gröbner bases
• On selection of nonmultiplicative prolongations in computation of Janet bases

This page was built for publication: Effectiveness of involutive criteria in computation of polynomial Janet bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433010)