Self-Matching Properties of Beatty Sequences
classification
🧮 math.CO
math.NT
keywords
betalfloorrfloorbeattyfunctionpropertiessequencestranslation
read the original abstract
We study the selfmatching properties of Beatty sequences, in particular of the graph of the function $\lfloor j\beta\rfloor $ against $j$ for every quadratic unit $\beta\in(0,1)$. We show that translation in the argument by an element $G_i$ of generalized Fibonacci sequence causes almost always the translation of the value of function by $G_{i-1}$. More precisely, for fixed $i\in\N$, we have $\bigl\lfloor \beta(j+G_i)\bigr\rfloor = \lfloor \beta j\rfloor +G_{i-1}$, where $j\notin U_i$. We determine the set $U_i$ of mismatches and show that it has a low frequency, namely $\beta^i$.
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.