Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2018.42
URN: urn:nbn:de:0030-drops-95802
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9580/
Almagor, Shaull ; Chapman, Brynmor ; Hosseini, Mehran ; Ouaknine, Joël ; Worrell, James
Effective Divergence Analysis for Linear Recurrence Sequences
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{almagor_et_al:LIPIcs:2018:9580,
author = {Shaull Almagor and Brynmor Chapman and Mehran Hosseini and Jo{\"e}l Ouaknine and James Worrell},
title = {{Effective Divergence Analysis for Linear Recurrence Sequences}},
booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)},
pages = {42:1--42:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-087-3},
ISSN = {1868-8969},
year = {2018},
volume = {118},
editor = {Sven Schewe and Lijun Zhang},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9580},
URN = {urn:nbn:de:0030-drops-95802},
doi = {10.4230/LIPIcs.CONCUR.2018.42},
annote = {Keywords: Linear recurrence sequences, Divergence, Algebraic numbers, Positivity}
}
| Keywords: | Linear recurrence sequences, Divergence, Algebraic numbers, Positivity | |
| Seminar: | 29th International Conference on Concurrency Theory (CONCUR 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 31.08.2018 |
