Completeness of Positive Linear Recurrence Sequences

From MaRDI portal



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 Hn+1=c1Hn+cdots+cLHn−L+1 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 Hnn=1infty is complete if and only if H1=1 and Hn+1leq1+sumi=1nHi. %A survey of these results can be found in cite{BHLLMT}. Finally, we adopt previous analytic work on PLRS's to find a more efficient way to check completeness. Specifically, the characteristic polynomial of any PLRS has exactly one positive root; by bounding the size of this root, the majority of sequences may be classified as complete or incomplete. Additionally, we show there exists an indeterminate region where the principal root does not reveal any information on completeness. We have conjectured precise bounds for this region.














This page was built for publication: Completeness of Positive Linear Recurrence Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6350505)