Effective Divergence Analysis for Linear Recurrence Sequences
Computational Complexity
2021-11-22 v2 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.1806.07740,
title = {Effective Divergence Analysis for Linear Recurrence Sequences},
author = {Shaull Almagor and Brynmor Chapman and Mehran Hosseini and Joël Ouaknine and James Worrell},
journal= {arXiv preprint arXiv:1806.07740},
year = {2021}
}
Comments
Published in CONCUR 2018