\(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases

DOI10.1016/j.tcs.2015.01.045zbMath1318.68202OpenAlexW2021945876MaRDI QIDQ2257300

Abdolali Basiri, Annick Valibouze, Marziyeh Boroujeni, Sajjad Rahmany

Publication date: 24 February 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.045

zbMATH Keywords

invariant ringSAGBI-Gröbner basis\(\mathrm F_4\) algorithm\(\mathrm F_5\) algorithm

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)

Uses Software

• Maple
• SageMath
• NTRU

Cites Work

• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Analogs of Gröbner bases in polynomial rings over a ring
• A note on computing SAGBI-Gröbner bases in a polynomial ring over a field
• Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
• Ideal and subalgebra coefficients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases