1,842 research outputs found
Gaussian Behavior of the Number of Summands in Zeckendorf Decompositions in Small Intervals
Zeckendorf's theorem states that every positive integer can be written
uniquely as a sum of non-consecutive Fibonacci numbers , with initial
terms . We consider the distribution of the number of
summands involved in such decompositions. Previous work proved that as the distribution of the number of summands in the Zeckendorf
decompositions of , appropriately normalized, converges
to the standard normal. The proofs crucially used the fact that all integers in
share the same potential summands.
We generalize these results to subintervals of as ; the analysis is significantly more involved here as different integers
have different sets of potential summands. Explicitly, fix an integer sequence
. As , for almost all the distribution of the number of summands in the Zeckendorf
decompositions of integers in the subintervals ,
appropriately normalized, converges to the standard normal. The proof follows
by showing that, with probability tending to , has at least one
appropriately located large gap between indices in its decomposition. We then
use a correspondence between this interval and to obtain
the result, since the summands are known to have Gaussian behavior in the
latter interval. % We also prove the same result for more general linear
recurrences.Comment: Version 1.0, 8 page
Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II
We deliver here second new recurrence formula,
were array is appointed by sequence of
functions which in predominantly considered cases where chosen to be
polynomials . Secondly, we supply a review of selected related combinatorial
interpretations of generalized binomial coefficients. We then propose also a
kind of transfer of interpretation of coefficients onto
coefficients interpretations thus bringing us back to
and Donald Ervin Knuth relevant investigation decades
ago.Comment: 57 pages, 8 figure
- β¦