English
Related papers

Related papers: Fast Algorithms for Refined Parameterized Telescop…

200 papers

A summation framework is developed that enhances Karr's difference field approach. It covers not only indefinite nested sums and products in terms of transcendental extensions, but it can treat, e.g., nested products defined over roots of…

Symbolic Computation · Computer Science 2015-02-04 Carsten Schneider

Recently, $R\Pi\Sigma^*$-extensions have been introduced which extend Karr's $\Pi\Sigma^*$-fields substantially: one can represent expressions not only in terms of transcendental sums and products, but one can work also with products over…

Symbolic Computation · Computer Science 2016-07-14 Carsten Schneider

We present a general framework in the setting of difference ring extensions that enables one to find improved representations of indefinite nested sums such that the arising denominators within the summands have reduced degrees. The…

Symbolic Computation · Computer Science 2023-02-08 Carsten Schneider

A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is…

Symbolic Computation · Computer Science 2025-06-11 Shaoshi Chen , Yiman Gao , Hui Huang , Carsten Schneider

We present an algebraic framework to represent indefinite nested sums over hypergeometric expressions in difference rings. In order to accomplish this task, parts of Karr's difference field theory have been extended to a ring theory in…

Symbolic Computation · Computer Science 2015-03-24 Carsten Schneider

In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. For instance, the algorithms have been applied successively to…

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

In recent years, Karr's difference field theory has been extended to the so-called $R\Pi\Sigma$-extensions in which one can represent not only indefinite nested sums and products that can be expressed by transcendental ring extensions, but…

Symbolic Computation · Computer Science 2017-10-31 Evans Doe Ocansey , Carsten Schneider

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

We present a complete algorithm that computes all hypergeometric solutions of homogeneous linear difference equations and rational solutions of parameterized linear difference equations in the setting of $\Pi\Sigma^*$-fields. More…

Symbolic Computation · Computer Science 2021-01-27 Sergei A. Abramov , Manuel Bronstein , Marko Petkovšek , Carsten Schneider

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

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…

Symbolic Computation · Computer Science 2013-04-17 Carsten Schneider

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

The ubiquity of the class of D-finite functions and P-recursive sequences in symbolic computation is widely recognized. In this thesis, the presented work consists of two parts related to this class. In the first part, we generalize the…

Symbolic Computation · Computer Science 2017-10-25 Hui Huang

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

In this paper, we introduce telescoping continued fractions to find lower bounds for the error term $r_n$ in Stirling's approximation $\displaystyle n! = \sqrt{2\pi}n^{n+1/2}e^{-n}e^{r_n}.$ This improves lower bounds given earlier by…

Classical Analysis and ODEs · Mathematics 2023-07-03 Gaurav Bhatnagar , Krishnan Rajkumar

Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums,where the harmonic sums and their…

Mathematical Physics · Physics 2009-11-11 S. Moch , P. Uwer

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

A summation is a shift-invariant ${\rm R}$-module homomorphism from a submodule of ${\rm R}[[\sigma]]$ to ${\rm R}$ or another ring. [11] formalized a method for extending a summation to a larger domain by telescoping. In this paper, we…

Commutative Algebra · Mathematics 2021-05-12 Robert Dawson , Grant Molnar

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

Based on a modified version of Abramov-Petkov\v{s}ek reduction, a new algorithm to compute minimal telescopers for bivariate hypergeometric terms was developed last year. We investigate further in this paper and present a new argument for…

Symbolic Computation · Computer Science 2016-05-16 Hui Huang
‹ Prev 1 2 3 10 Next ›