Effective divergence analysis for linear recurrence sequences

Shaull Almagor, Mehran Hosseini, Joël Ouaknine, James Worrell

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 e ective fine-grained lower bounds on the growth rate of the sequence.

Original languageEnglish
Title of host publication29th International Conference on Concurrency Theory, CONCUR 2018
EditorsSven Schewe, Lijun Zhang
DOIs
StatePublished - 1 Aug 2018
Externally publishedYes
Event29th International Conference on Concurrency Theory, CONCUR 2018 - Beijing, China
Duration: 4 Sep 20187 Sep 2018

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume118

Conference

Conference29th International Conference on Concurrency Theory, CONCUR 2018
Country/TerritoryChina
CityBeijing
Period4/09/187/09/18

Keywords

  • Algebraic numbers
  • Divergence
  • Phrases linear recurrence sequences
  • Positivity

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Effective divergence analysis for linear recurrence sequences'. Together they form a unique fingerprint.

Cite this