Signature-based standard basis algorithm under the framework of GVW algorithm

DOI10.1016/J.JSC.2024.102370MaRDI QIDQ6615411zbMATH OpenFDO

Authors Dong Lu, Dingkang Wang, Fanghui Xiao, Xiaopeng Zheng

Publication date 8 October 2024

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JSC.2024.102370

zbMATH Keywords

cover theoremMora normal form algorithmsemigroup orderssignature-based algorithmsstandard bases

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)

Review text

This paper focuses on the improvement of computing Gröbner bases. The starting point is the papers [\textit{S. Gao} et al., ISSAC 2010, 13--19 (2010; Zbl 1321.68531); \textit{S. Gao} et al., Math. Comput. 85, No. 297, 449--465 (2016; Zbl 1331.13018)], usually referred as GVM algorithm. In this paper, based on the famous Mora normal form algorithm, the authors extend the cover theorem to any semigroup order, which can be either global, local or even mixed. As a consequence, an algorithm for signature-based standard bases is presented for any semigroup order under the framework of the GVW algorithm is presented.

Recommendations

• A new signature-based algorithms for computing Gröbner bases
• Signature-based algorithms to compute Gröbner bases
• Improving incremental signature-based Gröbner basis algorithms
• A new framework for computing Gröbner bases
• A survey on signature-based algorithms for computing Gröbner bases

Cites work

• A generalized criterion for signature related Gröbner basis algorithms
• A new efficient algorithm for computing Gröbner bases (F₄)
• A new framework for computing Gröbner bases
• A new incremental algorithm for computing Groebner bases
• A survey on signature-based algorithms for computing Gröbner bases
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Extended \(F_5\) criteria
• Extending the GVW Algorithm to Local Ring
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• scientific article; zbMATH DE number 1726532 (Why is no real title available?)
• scientific article; zbMATH DE number 3649988 (Why is no real title available?)
• scientific article; zbMATH DE number 3857249 (Why is no real title available?)
• scientific article; zbMATH DE number 3907766 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 1263375 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Involutive bases algorithm incorporating F\(_5\) criterion
• On signature-based Gröbner bases over Euclidean rings
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• Signature-based algorithms for Gröbner bases over tate algebras
• Signature-based algorithms to compute Gröbner bases
• The F5 algorithm in Buchberger's style
• The F5 criterion revised
• Using Algebraic Geometry

This page was built for publication: Signature-based standard basis algorithm under the framework of GVW algorithm

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