A COLLECTION OF CENTRAL LIMIT TYPE RESULTS IN GENERALIZED ZECKENDORF DECOMPOSITIONS
A COLLECTION OF CENTRAL LIMIT TYPE RESULTS IN GENERALIZED ZECKENDORF DECOMPOSITIONS
复制标题
广义ZECKENDORF分解的中心极限类型结果的集合
DOI:
--
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
Steven J. Miller
中科院分区:
文献类型:
--
作者:
Steven J. Miller
Zeckendorf’s Theorem states that if the Fibonacci numbers are indexed as F1 = 1, F2 = 2, F3 = 3, F4 = 5, . . . , then every positive integer can be written uniquely as the sum of non-adjacent Fibonacci numbers. This result can be generalized to certain classes of linear recurrence relations {Gn} with appropriate notions of decompositions. For many decompositions, the distribution of the number of summands in the decomposition of an M ∈ [Gn, Gn+1) is known to converge to a Gaussian as n → ∞. This work discusses a more general approach to proving this kind of asymptotic Gaussian behavior that also bypasses technical obstructions in previous approaches. The approach is motivated by the binomials an,k = ( n k ) . The binomials satisfy the recursion an,k = an−1,k + an−1,k−1 and are well known to have the property that the random variables {Xn}n=1 given by Pr[Xn = k] = an,k/ ∑∞ i=0 an,i converge to a Gaussian as n → ∞. This new approach proves that appropriate two-dimensional recurrences exhibit similar asymptotic Gaussian behavior. From this, we can reprove that the number of summands in decompositions given by many linear recurrence relations is asymptotically Gaussian and additionally prove that for any non-negative integer g, the number of gaps of size g in the decomposition of an M ∈ [Gn, Gn+1) also converges to a Gaussian as n → ∞.
DOI:
--
发表时间:
2019
期刊:
The Fibonacci quarterly
影响因子:
--
作者:
Li, Ray;Miller, Steven J.
通讯作者:
Miller, Steven J.