GVW algorithm over principal ideal domains

DOI10.1007/S11424-013-2130-5MaRDI QIDQ2440326zbMATH OpenOpenAlexFDO

Authors Dongmei Li, Licui Zheng, Jinwang Liu, Weijun Liu

Publication date 18 March 2014

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-013-2130-5

zbMATH Keywords

Buchberger's algorithmF5 algorithmGröbner basisGVW algorithmprincipal ideal domain

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

The GVW algorithm, given by Gao, Wang, and Volny, for computing a Gröbner basis for an ideal in a polynomial ring, is known to be much faster and simpler than the algorithm F5. In this paper, the authors generalize the GVW algorithm and present an algorithm to compute a Gröbner basis for ideals when the coefficient ring is a principal ideal domain.

Recommendations

• A signature-based algorithm for computing Gröbner bases over principal ideal domains
• Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
• A new algorithm for an S-polynomial
• An improvement for GVW
• An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors

Cites work

• A generalized criterion for signature related Gröbner basis algorithms
• A new efficient algorithm for computing Gröbner bases (F₄)
• A new incremental algorithm for computing Groebner bases
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Extended \(F_5\) criteria
• 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 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 1263375 (Why is no real title available?)
• scientific article; zbMATH DE number 1120551 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• Strong Gröbner bases for polynomials over a principal ideal ring.

Cited in

(5)

• An involutive GVW algorithm and the computation of Pommaret bases
• A new algorithm for an S-polynomial
• On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
• Extending the GVW Algorithm to Local Ring
• An improvement over the GVW algorithm for inhomogeneous polynomial systems

Describes a project that uses

Uses Software

• F5C

This page was built for publication: GVW algorithm over principal ideal domains

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