A new iterative algorithm for comprehensive Gröbner systems

DOI10.1007/S00200-025-00684-8MaRDI QIDQ7255622zbMATH OpenFDO

Authors Anna Maria Bigatti, Elisa Palezzato, Michele Torielli

Publication date 1 June 2026

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00200-025-00684-8

zbMATH Keywords

algorithmcomprehensive Gröbner systemsGröbner basisradical membership

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)

Cites work

• A new algorithm for computing comprehensive Gröbner systems
• A new algorithm for discussing Gröbner bases with parameters.
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• A speed-up of the algorithm for computing comprehensive Gröbner systems
• An alternative approach to comprehensive Gröbner bases
• An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
• Canonical comprehensive Gröbner bases
• Comprehensive Gröbner bases
• On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems
• On the stability of Gröbner bases under specializations
• Stability conditions of monomial bases and comprehensive Gröbner systems

This page was built for publication: A new iterative algorithm for comprehensive Gröbner systems

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