English
Related papers

Related papers: Telescoping Algorithms for $\Sigma^*$-Extensions v…

200 papers

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 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

Parameterized telescoping (including telescoping and creative telescoping) and refined versions of it play a central role in the research area of symbolic summation. Karr introduced 1981 $\Pi\Sigma$-fields, a general class of difference…

Symbolic Computation · Computer Science 2013-12-31 Carsten Schneider

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

A complete reduction $\phi$ for derivatives in a differential field is a linear operator on the field over its constant subfield. The reduction enables us to decompose an element $f$ as the sum of a derivative and the remainder $\phi(f)$. A…

Symbolic Computation · Computer Science 2025-10-16 Hao Du , Yiman Gao , Wenqiao Li , Ziming Li

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

The Abramov-Petkovsek reduction computes an additive decomposition of a hypergeometric term, which extends the functionality of the Gosper algorithm for indefinite hypergeometric summation. We modify the Abramov-Petkovsek reduction so as to…

Symbolic Computation · Computer Science 2015-06-11 Shaoshi Chen , Hui Huang , Manuel Kauers , Ziming Li

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

Transcendental Liouvillian extensions are differential fields, in which one can model poly-logarithmic, hyperexponential, and trigonometric functions, logarithmic integrals, and their (nested) rational expressions. For such an extension…

Symbolic Computation · Computer Science 2026-02-04 Shaoshi Chen , Hao Du , Yiman Gao , Hui huang , Wenqiao Li , Ziming Li

Hermite reduction is a classical algorithmic tool in symbolic integration. It is used to decompose a given rational function as a sum of a function with simple poles and the derivative of another rational function. We extend Hermite…

Symbolic Computation · Computer Science 2023-06-12 Alin Bostan , Frédéric Chyzak , Pierre Lairez , Bruno Salvy

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

We consider the additive decomposition problem in primitive towers and present an algorithm to decompose a function in an S-primitive tower as a sum of a derivative in the tower and a remainder which is minimal in some sense. Special…

Symbolic Computation · Computer Science 2020-10-20 Hao Du , Jing Guo , Ziming Li , Elaine Wong

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

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 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

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

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

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

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
‹ Prev 1 2 3 10 Next ›