Elsevier

Discrete Mathematics

Volume 241, Issues 1–3, 28 October 2001, Pages 139-151
Discrete Mathematics

On the self matching properties of []

https://doi.org/10.1016/S0012-365X(01)00147-9Get rights and content
Under an Elsevier user license
open archive

Abstract

The graph of [] against j displays self matching in that if we displace this graph by a distance of Fi, then it is found that the displaced graph matches the original graph except at certain isolated points represented by an interesting Fibonacci function. From this it is shown that the frequency of mismatches is the unexpectedly simple expression 1/(τi). The results are proved using lemmas, based on Zeckendorf sums, which have an appeal of their own. These also give simplified solutions to the recurrence of Downey and Griswold. Similar results apply with the Golden Sequence whose jth term is [(j+1)τ]−[].

Keywords

Fibonacci
Zeckendorf
Self matching
Bernoulli integer sequences

Cited by (0)