English
Related papers

Related papers: A streamlined difference ring theory: Indefinite n…

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

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

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

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

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

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

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

We consider the following problem: Given a nested sum expression, find a sum representation such that the nested depth is minimal. We obtain a symbolic summation framework that solves this problem for sums defined, e.g., over…

Symbolic Computation · Computer Science 2009-04-16 Carsten Schneider

This paper investigates the geometric constraints imposed on a domain by overdetermined problems for partial differential equations. Serrin's symmetry results are extended to overdetermined problems with potentially degenerate ellipticity…

Analysis of PDEs · Mathematics 2025-06-04 Daomin Cao , Juncheng Wei , Weicheng Zhan

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

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

We introduce a general reduction strategy that enables one to search for solutions of parameterized linear difference equations in difference rings. Here we assume that the ring itself can be decomposed by a direct sum of integral domains…

Symbolic Computation · Computer Science 2021-02-08 Jakob Ablinger , 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

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

In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…

Computer Vision and Pattern Recognition · Computer Science 2018-02-26 D. Khuê Lê-Huu , Nikos Paragios
‹ Prev 1 2 3 10 Next ›