Completeness of Positive Linear Recurrence Sequences
El\.zbieta Bo{\l}dyriew, John Haviland, Ph\'uc L\^am, John Lentfer,, Steven J. Miller, Fernando Trejos Su\'arez

TL;DR
This paper classifies the completeness of positive linear recurrence sequences (PLRS) using Brown's criterion, providing characterizations for various families and proposing bounds for the completeness region based on the characteristic polynomial's root.
Contribution
It offers a complete classification of PLRS completeness for several families and introduces a more efficient method using root bounds to determine completeness.
Findings
Complete classification for several PLRS families.
A new method to check completeness via characteristic polynomial roots.
Identification of an indeterminate region where root size does not determine completeness.
Abstract
A sequence of positive integers is complete if every positive integer is a sum of distinct terms. A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with nonnegative coefficients of the form and a particular set of initial conditions. We seek to classify various PLRS's by completeness. With results on how completeness is affected by modifying the recurrence coefficients of a PLRS, we completely characterize completeness of several families of PLRS's as well as conjecturing criteria for more general families. Our primary method is applying Brown's criterion, which says that an increasing sequence is complete if and only if and . %A survey of these results can be found in \cite{BHLLMT}. Finally, we adopt…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · graph theory and CDMA systems
