pith. sign in

arxiv: 1409.0488 · v1 · pith:PYAILWQXnew · submitted 2014-09-01 · 🧮 math.NT

Generalizing Zeckendorf's Theorem: The Kentucky Sequence

classification 🧮 math.NT
keywords fibonaccilegalnumberrecurrencesequencedecompositionsdistributionfirst
0
0 comments X
read the original abstract

By Zeckendorf's theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be written uniquely as a sum of non-adjacent elements; this is called a legal decomposition. Previous work examined the distribution of the number of summands and the spacings between them, in legal decompositions arising from the Fibonacci numbers and other linear recurrence relations with non-negative integral coefficients. Many of these results were restricted to the case where the first term in the defining recurrence was positive. We study a generalization of the Fibonacci numbers with a simple notion of legality which leads to a recurrence where the first term vanishes. We again have unique legal decompositions, Gaussian behavior in the number of summands, and geometric decay in the distribution of gaps.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.