𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Maple package for computing Gröbner bases for linear recurrence relations

✍ Scribed by Vladimir P. Gerdt; Daniel Robertz

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
173 KB
Volume
559
Category
Article
ISSN
0168-9002

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

Computation of Gröbner bases for two-loo
Computation of Gröbner bases for two-loop propagator type integrals
✍ O.V. Tarasov 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 192 KB

The Gro¨bner basis technique for calculating Feynman diagrams proposed in (Acta Phys. Pol. B 29(1998) 2655) is applied to the two-loop propagator type integrals with arbitrary masses and momentum. We describe the derivation of Gro¨bner bases for all integrals with 1PI topologies and present explicit

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