A probabilistic approach to generalized Zeckendorf decompositions
From MaRDI portal
Publication:2813348
Markov processesfinite alphabetlongest gapZeckendorf decompositionspositive linear recurrence relationsdistribution of gaps
Convergence of probability measures (60B10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Density, gaps, topology (11B05) Numerical aspects of recurrence relations (65Q30)
Abstract: 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.
Recommendations
- Generalized Zeckendorf expansions
- The average gap distribution for generalized Zeckendorf decompositions
- Central limit theorems for gaps of generalized Zeckendorf decompositions
- The distribution of gaps between summands in generalized Zeckendorf decompositions (with an appendix by Iddo Ben-Ari and Steven J. Miller)
- Limiting distributions in generalized Zeckendorf decompositions
Cites work
- scientific article; zbMATH DE number 1263551 (Why is no real title available?)
- scientific article; zbMATH DE number 1896939 (Why is no real title available?)
- scientific article; zbMATH DE number 2099178 (Why is no real title available?)
- scientific article; zbMATH DE number 3373770 (Why is no real title available?)
- scientific article; zbMATH DE number 3378996 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- scientific article; zbMATH DE number 2213553 (Why is no real title available?)
- scientific article; zbMATH DE number 3076700 (Why is no real title available?)
- A counting based proof of the generalized Zeckendorf's theorem
- A generalization of Fibonacci far-difference representations and Gaussian behavior
- A generalization of Zeckendorf's theorem via circumscribed \(m\)-gons
- A generalization of a theorem of Lekkerkerker to Ostrowski's decomposition of natural numbers
- Central limit theorems for additive functionals of Markov chains.
- Contributions to digit expansions with respect to linear recurrences
- Corrigendum to ``Generalized Zeckendorf expansions
- Differences of multiple Fibonacci numbers
- Distribution of additive functions with respect to numeration systems on regular languages
- Distribution of the sum-of-digits function of random integers: a survey
- Fibonacci and Lucas numbers with applications. Volume I
- From Fibonacci numbers to central limit type theorems
- Gaussian asymptotic properties of the sum-of-digits function
- Gaussian behavior in generalized Zeckendorf decompositions
- Generalized Zeckendorf expansions
- Generalizing Zeckendorf's Theorem: The Kentucky Sequence
- Generalizing Zeckendorf's theorem to \(f\)-decompositions
- Greedy numeration systems and regularity
- Legal decompositions arising from non-positive linear recurrences
- New Behavior in Legal Decompositions Arising from Non-positive Linear Recurrences
- Numeration systems on a regular language
- Numeration systems, linear recurrences, and regular sets
- On the number of summands in Zeckendorf decompositions
- Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
- Probabilistic approach to Perron root, the group inverse, and applications
- Probability. Theory and examples.
- Representation of Natural Numbers as Sums of Generalised Fibonacci Numbers
- Systems of Numeration
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- The average gap distribution for generalized Zeckendorf decompositions
- The distribution of gaps between summands in generalized Zeckendorf decompositions (with an appendix by Iddo Ben-Ari and Steven J. Miller)
- The distribution of the sum-of-digits function
Cited in
(6)- Benford Behavior of Generalized Zeckendorf Decompositions
- scientific article; zbMATH DE number 1222518 (Why is no real title available?)
- Gaussian Behavior in Zeckendorf Decompositions From Lattices
- Zeckendorf representations and mixing properties of sequences
- Probabilistic equidimensional decomposition
- A generalization of a theorem of Lekkerkerker to Ostrowski's decomposition of natural numbers
This page was built for publication: A probabilistic approach to generalized Zeckendorf decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2813348)
