English

On Generalized Zeckendorf Decompositions and Generalized Golden Strings

Number Theory 2020-06-05 v1

Abstract

Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. A natural generalization of this theorem is to look at the sequence defined as follows: for n2n\ge 2, let Fn,1=Fn,2==Fn,n=1F_{n,1} = F_{n,2} = \cdots = F_{n,n} = 1 and Fn,m+1=Fn,m+Fn,m+1nF_{n, m+1} = F_{n, m} + F_{n, m+1-n} for all mnm\ge n. It is known that every positive integer has a unique representation as a sum of Fn,mF_{n,m}'s where the indexes of summands are at least nn apart. We call this the nn-decomposition. Griffiths showed an interesting relationship between the Zeckendorf decomposition and the golden string. In this paper, we continue the work to show a relationship between the nn-decomposition and the generalized golden string.

Keywords

Cite

@article{arxiv.2006.02966,
  title  = {On Generalized Zeckendorf Decompositions and Generalized Golden Strings},
  author = {Hung Viet Chu},
  journal= {arXiv preprint arXiv:2006.02966},
  year   = {2020}
}

Comments

8 pages

R2 v1 2026-06-23T16:03:44.238Z