✦ LIBER ✦

Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering

✍ Scribed by J.C. Faugère; P. Gianni; D. Lazard; T. Mora

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 462 KB
Volume: 16
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1993.1051

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gröbner Bases in Orders of Algebraic Num

Gröbner Bases in Orders of Algebraic Number Fields

✍ David Andrew Smith 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a Gröbner basis g

Computation of the Maximal Degree of the

Computation of the Maximal Degree of the Inverse of a Cubic Automorphism of the Affine Plane with Jacobian 1 via Gröbner Bases

✍ M. Fournié; J.-Ph. Furter; D. Pinchon 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 344 KB

In this paper we propose to compute the maximal degree of the inverse of a cubic automorphism of the affine plane with Jacobian 1 via Gröbner Bases. This degree is equal to 9 and we give coefficients of the inverse.