Self-Matching Properties of Beatty Sequences
DOI:
https://doi.org/10.14311/924Keywords:
Beatty sequences, Fibonacci numbers, cut-and-project schemeAbstract
We study the selfmatching properties of Beatty sequences, in particular of the graph of the function ⌊ jβ ⌋ against j for every quadratic unit βϵ (0,1). We show that translation in the argument by an element Gi of a generalized Fibonacci sequence almost always causes the translation of the value of the function by Gi=1. More precisely, for fixed i ϵ ℕ, we have ⌊β(j+Gi)⌋ = ⌊βj⌋ + Gi=1, where j ϵ Ui. We determine the set Ui of mismatches and show that it has a low frequency, namely βi.