2013/11/15 by Manuel Kauers, Kauers, Manuel, Lily Yen +1
Computer Science · #FOS: Computer and information sciences #Symbolic Computation (cs.SC) #cs.SC
paper · pdf · doi:10.48550/arxiv.1311.3720
21 pages, 2 figures, to appear in the Journal of Symbolic Computation
arxiv created 2014/02/24 · arxiv updated 2014/02/25
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 but lower degree we obtain a quintic bound. Experiments suggest that these bounds are tight. As applications of our results, we give an improved bound on the maximal possible integer root of the leading coefficient of a telescoper, and the first discussion of the bit complexity of creative telescoping.