English
Related papers

Related papers: A Difference Ring Theory for Symbolic Summation

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

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

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 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 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 general overview of the existing difference ring theory for symbolic summation is given. Special emphasis is put on the user interface: the translation and back translation of the corresponding representations within the term algebra and…

Symbolic Computation · Computer Science 2021-05-04 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

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

A non-trivial symbolic machinery is presented that can rephrase algorithmically a finite set of nested hypergeometric products in appropriately designed difference rings. As a consequence, one obtains an alternative representation in terms…

Symbolic Computation · Computer Science 2020-11-18 Evans Doe Ocansey , Carsten Schneider

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

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

The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide…

Symbolic Computation · Computer Science 2018-09-19 Peter Paule , 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

We outline a new algorithm to solve coupled systems of differential equations in one continuous variable $x$ (resp. coupled difference equations in one discrete variable $N$) depending on a small parameter $\epsilon$: given such a system…

Symbolic Computation · Computer Science 2014-07-11 Johannes Bluemlein , Abilio De Freitas , Carsten Schneider

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

In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In…

Symbolic Computation · Computer Science 2025-04-29 Carlos E. Arreche

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

An improved multi-summation approach is introduced and discussed that enables one to simultaneously handle indefinite nested sums and products in the setting of difference rings and holonomic sequences. Relevant mathematics is reviewed and…

Symbolic Computation · Computer Science 2017-10-31 Johannes Blümlein , Mark Round , Carsten Schneider

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