Effective Divergence Analysis for Linear Recurrence Sequences

06/20/2018
by   Shaull Almagor, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset