Gaussian Behavior in Generalized Zeckendorf Decompositions

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This is a survey article based on talks given at CANT 2010 and CANT 2011

Scientific paper

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/(\phi^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 $n \to \infty$, 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-2\phi)/(29+2\phi) \approx -0.551058$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Gaussian Behavior in Generalized Zeckendorf Decompositions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Gaussian Behavior in Generalized Zeckendorf Decompositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gaussian Behavior in Generalized Zeckendorf Decompositions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-224698

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.