Central limit theorems for gaps of generalized Zeckendorf decompositions

From MaRDI portal
(Redirected from Publication:5230671)



Abstract: Zeckendorf proved that every integer can be written uniquely as a sum of non-adjacent Fibonacci numbers 1,2,3,5,dots. This has been extended to many other recurrence relations Gn (with their own notion of a legal decomposition) and to proving that the distribution of the number of summands of an Min[Gn,Gn+1) converges to a Gaussian as noinfty. We prove that for any non-negative integer g the average number of gaps of size g in many generalized Zeckendorf decompositions is Cmun+dmu+o(1) for constants Cmu>0 and dmu depending on g and the recurrence, the variance of the number of gaps of size g is similarly Csigman+dsigma+o(1) with Csigma>0, and the number of gaps of size g of an Min[Gn,Gn+1) converges to a Gaussian as noinfty. The proof is by analysis of an associated two-dimensional recurrence; we prove a general result on when such behavior converges to a Gaussian, and additionally re-derive other results in the literature.












This page was built for publication: Central limit theorems for gaps of generalized Zeckendorf decompositions

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