Self-Matching Properties of Beatty Sequences

Abstract

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 generalized Fibonacci sequence causes almost always the translation of the value of 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…