Effectiveness of involutive criteria in computation of polynomial Janet bases

DOI10.1134/S0361768806030030zbMath1103.68987MaRDI QIDQ2433010

Vladimir P. Gerdt, D. A. Yanovich

Publication date: 26 October 2006

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

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 (5)

Involutive method for computing Gröbner bases over \(\mathbb F_2\) ⋮ Role of involutive criteria in computing Boolean Gröbner bases ⋮ Algorithmic Thomas decomposition of algebraic and differential systems ⋮ Involutive bases algorithm incorporating F\(_5\) criterion ⋮ Thomas Decomposition of Algebraic and Differential Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The theory of involutive divisions and an application to Hilbert function computations
• Involutive bases of polynomial ideals
• Detecting unnecessary reductions in an involutive basis computation
• Involutive divisions of monomials

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