18 research outputs found
On the existence of telescopers for mixed hypergeometric terms
International audienceWe present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on additive and multiplicative decompositions. The criterion enables us to determine the termination of Zeilberger's algorithms for mixed hypergeometric inputs, and to verify that certain indefinite sums do not satisfy any polynomial differential equation
Efficient Algorithms for Mixed Creative Telescoping
Creative telescoping is a powerful computer algebra paradigm -initiated by
Doron Zeilberger in the 90's- for dealing with definite integrals and sums with
parameters. We address the mixed continuous-discrete case, and focus on the
integration of bivariate hypergeometric-hyperexponential terms. We design a new
creative telescoping algorithm operating on this class of inputs, based on a
Hermite-like reduction procedure. The new algorithm has two nice features: it
is efficient and it delivers, for a suitable representation of the input, a
minimal-order telescoper. Its analysis reveals tight bounds on the sizes of the
telescoper it produces.Comment: To be published in the proceedings of ISSAC'1
How to generate all possible rational Wilf-Zeilberger pairs?
A Wilf--Zeilberger pair in the discrete case satisfies the equation
. We present a structural
description of all possible rational Wilf--Zeilberger pairs and their
continuous and mixed analogues.Comment: 17 pages, add the notion of pseudo residues in the differential case,
and some related papers in the reference, ACMES special volume in the Fields
Institute Communications series, 201
Reduction-Based Creative Telescoping for Definite Summation of D-finite Functions
Creative telescoping is an algorithmic method initiated by Zeilberger to
compute definite sums by synthesizing summands that telescope, called
certificates. We describe a creative telescoping algorithm that computes
telescopers for definite sums of D-finite functions as well as the associated
certificates in a compact form. The algorithm relies on a discrete analogue of
the generalized Hermite reduction, or equivalently, a generalization of the
Abramov-Petkov\v sek reduction. We provide a Maple implementation with good
timings on a variety of examples.Comment: 15 page
Simplifying Multiple Sums in Difference Fields
In this survey article we present difference field algorithms for symbolic
summation. Special emphasize is put on new aspects in how the summation
problems are rephrased in terms of difference fields, how the problems are
solved there, and how the derived results in the given difference field can be
reinterpreted as solutions of the input problem. The algorithms are illustrated
with the Mathematica package \SigmaP\ by discovering and proving new harmonic
number identities extending those from (Paule and Schneider, 2003). In
addition, the newly developed package \texttt{EvaluateMultiSums} is introduced
that combines the presented tools. In this way, large scale summation problems
for the evaluation of Feynman diagrams in QCD (Quantum ChromoDynamics) can be
solved completely automatically.Comment: Uses svmult.cls, to appear as contribution in the book "Computer
Algebra in Quantum Field Theory: Integration, Summation and Special
Functions" (www.Springer.com