On the Positivity Problem for Simple Linear Recurrence Sequences
classification
💻 cs.DM
keywords
positivitylinearproblemrecurrencesequencesimpleaskscharacteristic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.