24 research outputs found
A Probabilistic Approach to Generalized Zeckendorf Decompositions
Generalized Zeckendorf decompositions are expansions of integers as sums of
elements of solutions to recurrence relations. The simplest cases are base-
expansions, and the standard Zeckendorf decomposition uses the Fibonacci
sequence. The expansions are finite sequences of nonnegative integer
coefficients (satisfying certain technical conditions to guarantee uniqueness
of the decomposition) and which can be viewed as analogs of sequences of
variable-length words made from some fixed alphabet. In this paper we present a
new approach and construction for uniform measures on expansions, identifying
them as the distribution of a Markov chain conditioned not to hit a set. This
gives a unified approach that allows us to easily recover results on the
expansions from analogous results for Markov chains, and in this paper we focus
on laws of large numbers, central limit theorems for sums of digits, and
statements on gaps (zeros) in expansions. We expect the approach to prove
useful in other similar contexts.Comment: Version 1.0, 25 pages. Keywords: Zeckendorf decompositions, positive
linear recurrence relations, distribution of gaps, longest gap, Markov
processe
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