A generalization of Fibonacci far-difference representations and Gaussian behavior

MaRDI QIDQ3191270zbMATH OpenFDO

Authors Philippe Demontigny, Archit Kulkarni, Steven J. Miller, Umang Varma, Thao Do

Publication date 1 October 2014

Full work available at URL https://arxiv.org/abs/1309.5600, http://www.fq.math.ca/Abstracts/52-3/demontigny.pdf

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Numerical aspects of recurrence relations (65Q30)

Abstract: A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $F_n$, with $F_{n+1}=F_n+F_{n-1}$ and $F_1=1,F_2=2$. If instead we allow the coefficients of the Fibonacci numbers in the decomposition to be zero or $pm1$, the resulting expression is known as the far-difference representation. Alpert proved that a far-difference representation exists and is unique under certain restraints that generalize non-consecutiveness, specifically that two adjacent summands of the same sign must be at least 4 indices apart and those of opposite signs must be at least 3 indices apart. We prove that a far-difference representation can be created using sets of Skipponacci numbers, which are generated by recurrence relations of the form $S_{n+1}^{(k)}=S_n^{(k)}+S_{n-k}^{(k)}$ for $kge0$. Every integer can be written uniquely as a sum of the $pm{S}_n^{(k)}$'s such that every two terms of the same sign differ in index by at least 2k+2, and every two terms of opposite signs differ in index by at least k+2. Additionally, we prove that the number of positive and negative terms in given Skipponacci decompositions converges to a Gaussian, with a computable correlation coefficient that is a rational function of the smallest root of the characteristic polynomial of the recurrence. The proof uses recursion to obtain the generating function for having a fixed number of summands, which we prove converges to the generating function of a Gaussian. We next explore the distribution of gaps between summands, and show that for any k the probability of finding a gap of length $jge2k+2$ decays geometrically, with decay ratio equal to the largest root of the given k-Skipponacci recurrence. We conclude by finding sequences that have an (s,d) far-difference representation for any positive integers s,d.

Recommendations

• On the number of summands in Zeckendorf decompositions
• The average gap distribution for generalized Zeckendorf decompositions
• The distribution of gaps between summands in generalized Zeckendorf decompositions (with an appendix by Iddo Ben-Ari and Steven J. Miller)
• scientific article; zbMATH DE number 6985720
• Gaussian behavior in generalized Zeckendorf decompositions

Cited in

(4)

• A probabilistic approach to generalized Zeckendorf decompositions
• scientific article; zbMATH DE number 5578246 (Why is no real title available?)
• The distribution of gaps between summands in generalized Zeckendorf decompositions (with an appendix by Iddo Ben-Ari and Steven J. Miller)
• A new Gaussian Fibonacci matrices and its applications

This page was built for publication: A generalization of Fibonacci far-difference representations and Gaussian behavior

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191270)