𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple signature based iterative algorithm for calculation of Gröbner bases

✍ Scribed by Galkin, V. V.

Book ID
121607676
Publisher
Allerton Press Inc
Year
2013
Tongue
English
Weight
378 KB
Volume
68
Category
Article
ISSN
0027-1322

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Modular algorithms for computing Gröbner
Modular algorithms for computing Gröbner bases
✍ Elizabeth A. Arnold 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Intermediate coefficient swell is a well-known difficulty with Buchberger's algorithm for computing Gröbner bases over the rational numbers. p-Adic and modular methods have been successful in limiting intermediate coefficient growth in other computations, and in particular in the Euclidian algorithm

A New Algorithm for Discussing Gröbner B
A New Algorithm for Discussing Gröbner Bases with Parameters
✍ Antonio Montes 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Let F be a set of polynomials in the variables x = x 1 , . . . , xn with coefficients in R[a], where R is a UFD and a = a 1 , . . . , am a set of parameters. In this paper we present a new algorithm for discussing Gröbner bases with parameters. The algorithm obtains all the cases over the parameters