Existence Problem of Telescopers: Beyond the Bivariate Case

01/12/2016
by   Shaoshi Chen, et al.
0

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 existence criteria we present is needed for detecting the termination of Zeilberger's algorithm to the function classes studied in this paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2019

Existence Problem of Telescopers for Rational Functions in Three Variables: the Mixed Cases

We present criteria on the existence of telescopers for trivariate ratio...
research
06/28/2017

Bivariate Extensions of Abramov's Algorithm for Rational Summation

Abramov's algorithm enables us to decide whether a univariate rational f...
research
02/20/2020

On the Uniqueness of Simultaneous Rational Function Reconstruction

This paper focuses on the problem of reconstructing a vector of rational...
research
01/27/2019

On the Existence of Telescopers for Rational Functions in Three Variables

Zeilberger's method of creative telescoping is crucial for the computer-...
research
04/25/2019

Constructing minimal telescopers for rational functions in three discrete variables

We present a new algorithm for constructing minimal telescopers for rati...
research
11/01/2020

A polynomial algorithm for minimizing discrete convic functions in fixed dimension

Recently classes of conic and discrete conic functions were introduced. ...
research
09/15/2019

Efficient Rational Creative Telescoping

We present a new algorithm to compute minimal telescopers for rational f...

Please sign up or login with your details

Forgot password? Click here to reset