New Bounds for Hypergeometric Creative Telescoping

04/27/2016
by   Hui Huang, et al.
0

Based on a modified version of Abramov-Petkovš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 the termination of this algorithm, which provides an independent proof of the existence of telescopers and even enables us to derive lower as well as upper bounds for the order of telescopers for hypergeometric terms. Compared to the known bounds in the literature, our bounds are sometimes better, and never worse than the known ones.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2017

Definite Sums of Hypergeometric Terms and Limits of P-Recursive Sequences

The ubiquity of the class of D-finite functions and P-recursive sequence...
research
07/29/2021

Density of Binary Disc Packings:Lower and Upper Bounds

We provide, for any r∈ (0,1), lower and upper bounds on the maximal dens...
research
06/05/2018

A Framework for the construction of upper bounds on the number of affine linear regions of ReLU feed-forward neural networks

In this work we present a new framework to derive upper bounds on the nu...
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
05/17/2016

Efficient Algorithms for Mixed Creative Telescoping

Creative telescoping is a powerful computer algebra paradigm -initiated ...
research
11/02/2020

Stronger bounds on the cost of computing Groebner bases for HFE systems

We give upper bounds for the solving degree and the last fall degree of ...
research
05/17/2023

Improved Bounds for Single-Nomination Impartial Selection

We give new bounds for the single-nomination model of impartial selectio...

Please sign up or login with your details

Forgot password? Click here to reset