Related papers: New Bounds for Hypergeometric Creative Telescoping
Leveraging a general framework adapted from symbolic integration, a unified reduction-based algorithm for computing telescopers of minimal order for hypergeometric and q-hypergeometric terms has been recently developed. In this paper, we…
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…
We present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on multiplicative and additive decompositions. The criterion enables us to determine the termination of Zeilberger's algorithms for mixed…
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.…
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…
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…
Continuing a series of articles in the past few years on creative telescoping using reductions, we develop a new algorithm to construct minimal telescopers for algebraic functions. This algorithm is based on Trager's Hermite reduction and…
We extend the criterion on the existence of telescopers for hypergeometric terms to the case of P-recursive sequences. This criterion is based on the concept of integral bases and the generalized Abramov-Petkovsek reduction for P-recursive…
We present a new algorithm for constructing minimal telescopers for rational functions in three discrete variables. This is the first discrete reduction-based algorithm that goes beyond the bivariate case. The termination of the algorithm…
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…
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…
We present a new algorithm to compute minimal telescopers for rational functions in two discrete variables. As with recent reduction-based approaches, our algorithm has the important feature that the computation of a telescoper is…
We present a reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition and allows to decide…
We show that the problem of constructing telescopers for functions of m variables is equivalent to the problem of constructing telescopers for algebraic functions of m -1 variables and present a new algorithm to construct telescopers for…
In this paper, we solve the existence problem of telescopers for rational functions in three discrete variables. We reduce the problem to that of deciding the summability of bivariate rational functions, which has been solved recently. The…
We analyze the differential equations produced by the method of creative telescoping applied to a hyperexponential term in two variables. We show that equations of low order have high degree, and that higher order equations have lower…
A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov- Trifonov bound in a similar way as the Hartmann-Tzeng bound extends…
The goal of this work is to fill a gap in [Yang, SIAM J. Matrix Anal. Appl, 41 (2020), 1797--1825]. In that work, an approximation procedure was proposed for orthogonal low-rank tensor approximation; however, the approximation lower bound…
The long-term goal initiated in this work is to obtain fast algorithms and implementations for definite integration in Almkvist and Zeilberger's framework of (differential) creative telescoping. Our complexity-driven approach is to obtain…
We outline basic principles of a new method that gives a conceptual reasoning for and, at the same time, proofs of (super)congruences for truncated sums of arithmetic hypergeometric evaluations.