English
Related papers

Related papers: Complexity of Creative Telescoping for Bivariate R…

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

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

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

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 showcase a collection of practical strategies to deal with a problem arising from an analysis of integral estimators derived via quasi-Monte Carlo methods. The problem reduces to a triple binomial sum, thereby enabling us to open up the…

Symbolic Computation · Computer Science 2021-07-27 Christoph Koutschan , Elaine Wong

We show that the number of digits in the integers of a creative telescoping relation of expected minimal order for a bivariate proper hypergeometric term has essentially cubic growth with the problem size. For telescopers of higher order…

Symbolic Computation · Computer Science 2014-02-25 Manuel Kauers , Lily Yen

Creative telescoping applied to a bivariate proper hypergeometric term produces linear recurrence operators with polynomial coefficients, called telescopers. We provide bounds for the degrees of the polynomials appearing in these operators.…

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

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

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

We give necessary and sufficient conditions for the existence of telescopers for rational functions of two variables in the continuous, discrete and q-discrete settings and characterize which operators can occur as telescopers. Using this…

Combinatorics · Mathematics 2012-03-20 Shaoshi Chen , Michael F. Singer

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

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

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

Applying Zeilberger's algorithm of creative telescoping to a family of certain very-well-poised hypergeometric series involving linear forms in Catalan's constant with rational coefficients, we obtain a second-order difference equation for…

Number Theory · Mathematics 2025-10-20 Wadim Zudilin

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

Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…

Numerical Analysis · Mathematics 2025-10-03 James Chok , Geoffrey M. Vasil

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

The purpose of this paper is to combine classical methods from transcendental number theory with the technique of restriction to real scalars. We develop a conceptual approach relating transcendence properties of algebraic groups to results…

Number Theory · Mathematics 2011-08-26 Aleksander Lech Momot

In radio astronomy, the science output of a telescope is often limited by computational resources. This is especially true for transient and technosignature surveys that need to search high-resolution data across a large parameter space.…

Instrumentation and Methods for Astrophysics · Physics 2024-04-11 Danny C. Price

In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We…

Algebraic Geometry · Mathematics 2017-02-02 J. Rafael Sendra , David Sevilla , Carlos Villarino