Gaussian behavior in generalized Zeckendorf decompositions

DOI10.1007/978-1-4939-1601-6_12zbMATH Open1343.11022arXiv1107.2718OpenAlexW2139784971MaRDI QIDQ5265396FDOQ5265396

Authors: Steven J. Miller, Yinghui Wang 

Publication date: 23 July 2015

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Abstract: A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers ${F_n}_{n=1}^{infty}$; Lekkerkerker proved that the average number of summands for integers in $[F_n,F_{n+1})$ is $n/(ph{i}^2+1)$, with $phi$ the golden mean. Interestingly, the higher moments seem to have been ignored. We discuss the proof that the distribution of the number of summands converges to a Gaussian as $noinfty$, and comment on generalizations to related decompositions. For example, every integer can be written uniquely as a sum of the $pm{F}_n$'s, such that every two terms of the same (opposite) sign differ in index by at least 4 (3). The distribution of the numbers of positive and negative summands converges to a bivariate normal with computable, negative correlation, namely $-(21-2phi)/(29+2phi)approx-0.551058$.

Full work available at URL: https://arxiv.org/abs/1107.2718

Recommendations

• From Fibonacci numbers to central limit type theorems
• On the number of summands in Zeckendorf decompositions
• Gaussian Behavior in Zeckendorf Decompositions From Lattices
• Gaussian behavior of the number of summands in Zeckendorf decompositions in small intervals
• Gaussian distribution of the number of summands in generalized Zeckendorf decompositions in small intervals

zbMATH Keywords

generating functionsFibonacci numbersZeckendorf's theorempartial fraction expansioncentral limit type theoremsfar-difference representationsLekkerkerker's theorem

Mathematics Subject Classification ID

Convergence of probability measures (60B10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Numerical aspects of recurrence relations (65Q30)

Cited In (19)

• A generalization of Fibonacci far-difference representations and Gaussian behavior
• Benford Behavior of Generalized Zeckendorf Decompositions
• Gaussian behavior of the number of summands in Zeckendorf decompositions in small intervals
• Generalizing Zeckendorf's theorem to \(f\)-decompositions
• Benford behavior of Zeckendorf decompositions
• From Fibonacci numbers to central limit type theorems
• Gaussian Behavior in Zeckendorf Decompositions From Lattices
• Bin decompositions
• The Zeckendorf Game
• Gaussian distribution of the number of summands in generalized Zeckendorf decompositions in small intervals
• On the Combinatorics of Placing Balls into Ordered Bins
• Limiting distributions in generalized Zeckendorf decompositions
• The distribution of gaps between summands in generalized Zeckendorf decompositions (with an appendix by Iddo Ben-Ari and Steven J. Miller)
• Central limit theorems for compound paths on the two-dimensional lattice
• A probabilistic approach to generalized Zeckendorf decompositions
• On the number of summands in Zeckendorf decompositions
• The accelerated Zeckendorf game
• The Gaussian Zoo
• On Zeckendorf Related Partitions Using the Lucas Sequence

This page was built for publication: Gaussian behavior in generalized Zeckendorf decompositions

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