A Maple Package for Computing Groebner Bases for Linear Recurrence Relations
نویسندگان
چکیده
A Maple package for computing Gröbner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for example, for automatic generation of difference schemes for linear partial differential equations and for reduction of multiloop Feynman integrals. These two possible applications are illustrated by simple examples of the Laplace equation and a one-loop scalar integral of propagator type.
منابع مشابه
Groebner Bases Applied to Systems of Linear Difference Equations
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high energy physics as recurrence relations for multiloop Feynman integrals. The most universal algorithmic tool for investigation of linear difference systems is b...
متن کاملA Maple Package for Computing Gröbner Bases for Linear Recurrence Relations
A Maple package for computing Gröbner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for example, for automatic generation of difference schemes for linear partial differential equations and for reduction of multiloop Feynman integrals. These two po...
متن کاملComputation of Difference Groebner Bases
This paper is an updated and extended version of our note [1] (cf. also [2]). To compute difference Gröbner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the package LDA (Linear Difference Algebra) and we describe the main features of the pa...
متن کاملGröbner Bases Applied to Systems of Linear Difference Equations
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high energy physics as recurrence relations for multiloop Feynman integrals. The most universal algorithmic tool for investigation of linear difference systems is b...
متن کاملOn the structure of Hermitian codes1
Let X,,, denote the Hermitian curve xm+’ = ym + y over the field F,,,z. Let Q be the single point at infinity, and let D be the sum of the other rn3 points of X,,, rational over F,,,z, each with multiplicity 1. X,,, has a cyclic group of automorphisms of order m2 1, which induces automorphisms of each of the the one-point algebraic geometric Goppa codes &(D,uQ) and their duals. As a result, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0509070 شماره
صفحات -
تاریخ انتشار 2005