On selection of nonmultiplicative prolongations in computation of Janet bases

DOI10.1134/S0361768807030048zbMath1147.68878OpenAlexW1975063405MaRDI QIDQ926621

Yu. A. Blinkov, Vladimir P. Gerdt

Publication date: 20 May 2008

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

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

zbMATH Keywords

Magma computer algebra system

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

Involutive method for computing Gröbner bases over \(\mathbb F_2\), Involutive bases algorithm incorporating F\(_5\) criterion

Uses Software

• FGb

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing toric ideals
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Converting bases with the Gröbner walk
• Involutive bases of polynomial ideals
• Computer Algebra in Scientific Computing
• Involutive divisions of monomials