2000 character limit reached
On (almost) realizable subsequences of linearly recurrent sequences
Published 6 Apr 2022 in math.NT and math.DS | (2204.02711v2)
Abstract: In this note we show that if $(u_n){n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu{ns})_{n\geqslant 1}$ is the sequence of periodic point counts for some map for a suitable positive integer $M$ and $s$ any sufficiently large multiple of $k!$. This extends a result of Moss and Ward [The Fibonacci Quarterly 60 (2022), 40-47] who proved the result for the Fibonacci sequence.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.