Bin decompositions
From MaRDI portal
Abstract: It is well known that every positive integer can be expressed as a sum of nonconsecutive Fibonacci numbers provided the Fibonacci numbers satisfy for , and . In this paper, for any we create a sequence called the -bin sequence with which we can define a notion of a legal decomposition for every positive integer. These sequences are not always positive linear recurrences, which have been studied in the literature, yet we prove, that like positive linear recurrences, these decompositions exist and are unique. Moreover, our main result proves that the distribution of the number of summands used in the -bin legal decompositions displays Gaussian behavior.
Recommendations
- Generalizing Zeckendorf's theorem to \(f\)-decompositions
- New Behavior in Legal Decompositions Arising from Non-positive Linear Recurrences
- Limiting distributions in generalized Zeckendorf decompositions
- Gaps of summands of the Zeckendorf lattice
- Legal decompositions arising from non-positive linear recurrences
Cites work
- A counting based proof of the generalized Zeckendorf's theorem
- A generalization of Zeckendorf's theorem via circumscribed m-gons
- Gaussian behavior in generalized Zeckendorf decompositions
- Generalizing Zeckendorf's theorem to \(f\)-decompositions
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- scientific article; zbMATH DE number 3076700 (Why is no real title available?)
- Individual gap measures from generalized Zeckendorf decompositions
Cited in
(4)
This page was built for publication: Bin decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1731045)