English
Related papers

Related papers: Creative Telescoping on Multiple Sums

200 papers

Creative telescoping is the method of choice for obtaining information about definite sums or integrals. It has been intensively studied since the early 1990s, and can now be considered as a classical technique in computer algebra. At the…

Symbolic Computation · Computer Science 2016-09-14 Shaoshi Chen , Manuel Kauers

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…

Symbolic Computation · Computer Science 2023-11-21 Hadrien Brochet , Bruno Salvy

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…

Symbolic Computation · Computer Science 2016-05-18 Alin Bostan , Louis Dumont , Bruno Salvy

Usually creative telescoping is used to derive recurrences for sums. In this article we show that the non-existence of a creative telescoping solution, and more generally, of a parameterized telescoping solution, proves algebraic…

Symbolic Computation · Computer Science 2008-09-02 Carsten Schneider

We extend Zeilberger's approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals involving Stirling or Bernoulli numbers, incomplete Gamma…

Symbolic Computation · Computer Science 2013-06-19 Frédéric Chyzak , Manuel Kauers , Bruno Salvy

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

Symbolic Computation · Computer Science 2023-06-12 Alin Bostan , Pierre Lairez , Bruno Salvy

We present a new algorithm to compute minimal telescopers for rational functions in two discrete variables. As with recent reduction-based approaches, our algorithm has the important feature that the computation of a telescoper is…

Symbolic Computation · Computer Science 2021-08-10 Mark Giesbrecht , Hui Huang , George Labahn , Eugene Zima

Creative telescoping algorithms compute linear differential equations satisfied by multiple integrals with parameters. We describe a precise and elementary algorithmic version of the Griffiths-Dwork method for the creative telescoping of…

Symbolic Computation · Computer Science 2023-06-12 Alin Bostan , Pierre Lairez , Bruno Salvy

Symbolic summation as an active research topic of symbolic computation provides efficient algorithmic tools for evaluating and simplifying different types of sums arising from mathematics, computer science, physics and other areas. Most of…

Symbolic Computation · Computer Science 2025-03-18 Shaoshi Chen , Lixin Du , Hanqian Fang

The aim of this article is twofold: on the one hand it is intended to serve as a gentle introduction to the topic of creative telescoping, from a practical point of view; for this purpose its application to several problems is exemplified.…

Symbolic Computation · Computer Science 2013-07-18 Christoph Koutschan

We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which…

Symbolic Computation · Computer Science 2024-01-30 Peter Paule , Carsten Schneider

Zeilberger's method of creative telescoping is crucial for the computer-generated proofs of combinatorial and special-function identities. Telescopers are linear differential or ($q$-)recurrence operators computed by algorithms for creative…

Symbolic Computation · Computer Science 2020-02-18 Shaoshi Chen , Lixin Du , Rong-Hua Wang , Chaochao Zhu

The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration in Almkvist and Zeilberger's framework of (differential) creative telescoping. Our complexity-driven approach is to obtain…

Symbolic Computation · Computer Science 2013-01-23 Alin Bostan , Shaoshi Chen , Frédéric Chyzak , Ziming Li

We propose a way to split a given bivariate P-recursive sequence into a summable part and a non-summable part in such a way that the non-summable part is minimal in some sense. This decomposition gives rise to a new reduction-based creative…

Symbolic Computation · Computer Science 2023-11-10 Shaoshi Chen , Lixin Du , Manuel Kauers , Rong-Hua Wang

In this note we reinvestigate the task of computing creative telescoping relations in differential-difference operator algebras. Our approach is based on an ansatz that explicitly includes the denominators of the delta parts. We contribute…

Symbolic Computation · Computer Science 2011-06-28 Christoph Koutschan

The efficient evaluation of high-dimensional integrals is of importance in both theoretical and practical fields of science, such as data science, statistical physics, and machine learning. However, exact computation methods suffer from the…

Statistics Theory · Mathematics 2017-12-15 Radislav Vaisman , Robert Salomone , Dirk P. Kroese

We adapt the theory of normal and special polynomials from symbolic integration to the summation setting, and then built up a general framework embracing both the usual shift case and the $q$-shift case. In the context of this general…

Symbolic Computation · Computer Science 2025-07-29 Shaoshi Chen , Hao Du , Yiman Gao , Hui Huang , Ziming Li

In terms of the telescoping method, a simple binomial sum is given. By applying the derivative operators to the equation just mentioned, we establish several general harmonic number identities including some known results.

Combinatorics · Mathematics 2012-03-12 Chuanan Wei , Dianxuan Gong

We analyze the differential equations produced by the method of creative telescoping applied to a hyperexponential term in two variables. We show that equations of low order have high degree, and that higher order equations have lower…

Symbolic Computation · Computer Science 2012-02-01 Shaoshi Chen , Manuel Kauers

For given multivariate functions specified by algebraic, differential or difference equations, the separability problem is to decide whether they satisfy linear differential or difference equations in one variable. In this paper, we will…

Symbolic Computation · Computer Science 2021-02-09 Shaoshi Chen , Ruyong Feng , Pingchuan Ma , Michael F. Singer
‹ Prev 1 2 3 10 Next ›