New Bounds for Hypergeometric Creative Telescoping

DOI10.1145/2930889.2930893MaRDI QIDQ2985838zbMATH OpenOpenAlexFDO

Authors Hui Huang

Publication date 10 May 2017

Published in Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.08059

zbMATH Keywords

hypergeometric termmodified Abramov-Petkovsek reductionorder boundtelescoper

Mathematics Subject Classification ID

Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Symbolic computation and algebraic computation (68W30)

Abstract: Based on a modified version of Abramov-Petkovv{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 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.

Recommendations

• Hermite reduction and creative telescoping for hyperexponential functions
• Order-degree curves for hypergeometric creative telescoping
• A new result for hypergeometric polynomials
• Complexity of creative telescoping for bivariate rational functions
• A new generalization of generalized hypergeometric functions
• scientific article; zbMATH DE number 1359853
• New Bounds for Hahn and Krawtchouk Polynomials
• New asymptotic expansions on hyperfactorial functions
• New bounds for generalized Taylor expansions
• On the existence of telescopers for mixed hypergeometric terms

Cited in

(15)

• The Ore-Sato theorem and shift exponents in the \(q\)-difference case
• Constructing minimal telescopers for rational functions in three discrete variables
• On the length of integers in telescopers for proper hypergeometric terms
• Linear differential equations as a data structure
• Some open problems related to creative telescoping
• Reduction-based creative telescoping for Fuchsian D-finite functions
• On the order of the recurrence produced by the method of creative telescoping
• Constructing reductions for creative telescoping. The general differentially finite case
• A modified Abramov-Petkovsek reduction and creative telescoping for hypergeometric terms
• Order-degree curves for hypergeometric creative telescoping
• Polynomial reduction for holonomic sequences and applications in -series and congruences
• A unified reduction for hypergeometric and q-hypergeometric creative telescoping
• On the existence of telescopers for P-recursive sequences
• Non-minimality of minimal telescopers explained by residues
• Efficient rational creative telescoping

This page was built for publication: New Bounds for Hypergeometric Creative Telescoping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985838)