English

Self-Matching Properties of Beatty Sequences

Combinatorics 2007-05-23 v1 Number Theory

Abstract

We study the selfmatching properties of Beatty sequences, in particular of the graph of the function jβ\lfloor j\beta\rfloor against jj for every quadratic unit β(0,1)\beta\in(0,1). We show that translation in the argument by an element GiG_i of generalized Fibonacci sequence causes almost always the translation of the value of function by Gi1G_{i-1}. More precisely, for fixed iNi\in\N, we have β(j+Gi)=βj+Gi1\bigl\lfloor \beta(j+G_i)\bigr\rfloor = \lfloor \beta j\rfloor +G_{i-1}, where jUij\notin U_i. We determine the set UiU_i of mismatches and show that it has a low frequency, namely βi\beta^i.

Keywords

Cite

@article{arxiv.math/0609631,
  title  = {Self-Matching Properties of Beatty Sequences},
  author = {Zuzana Masáková and Edita Pelantová},
  journal= {arXiv preprint arXiv:math/0609631},
  year   = {2007}
}

Comments

7 pages

R2 v1 2026-07-22T17:42:51.111Z