On the Positivity Problem for Simple Linear Recurrence Sequences
Discrete Mathematics
2014-04-29 v3
Abstract
Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem} asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9 or less, Positivity is decidable, with complexity in the Counting Hierarchy.
Keywords
Cite
@article{arxiv.1309.1550,
title = {On the Positivity Problem for Simple Linear Recurrence Sequences},
author = {Joel Ouaknine and James Worrell},
journal= {arXiv preprint arXiv:1309.1550},
year = {2014}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1307.2779