RO EN
Computation of Difference Gröbner Bases
Authors: V. P. Gerdt, D. Robertz
– 0.22 Mb
Abstract
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 package. Its applications are illustrated by generation of finite difference approximations to linear partial differential equations and by reduction of Feynman integrals. We also present the algorithm for an ideal generated by a finite set of nonlinear difference polynomials. If the algorithm terminates, then it constructs a Gröbner basis of the ideal.Vladimir P. Gerdt
Laboratory of Information Technologies
Joint Institute for Nuclear Research
141980 Dubna, Russia
E-mail:
Daniel Robertz
Lehrstuhl B für Mathematik
RWTH Aachen
52062 Aachen, Germany
E-mail:
Laboratory of Information Technologies
Joint Institute for Nuclear Research
141980 Dubna, Russia
E-mail:
Daniel Robertz
Lehrstuhl B für Mathematik
RWTH Aachen
52062 Aachen, Germany
E-mail:
Fulltext
– 0.22 Mb
Contents
- Svetlana Cojocaru (in honour of her 60th anniversary)
- Languages and P Systems: Recent Developments
- Self-Stabilization in Membrane Systems*
- Usability in Scientific Databases
- Yet Another Method for Image Segmentation based on Histograms and Heuristics*
- Medical Image Registration by means of a Bio-Inspired Optimization Strategy
- Computation of Difference Gröbner Bases
- Finding Translation Examples for Under-Resourced Language Pairs or for Narrow Domains; the Case for Machine Translation
- Comparison of indices of disproportionality in PR systems
