Effective Divergence Analysis for Linear Recurrence Sequences

06/20/2018

∙

by   Shaull Almagor, et al.

∙

0

∙

share

We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational linear recurrence sequence and computes effective fine-grained lower bounds on the growth rate of the sequence.