Self-Matching Properties of Beatty Sequences
Zuzana Masáková, Edita Pelantová
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.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.