Zeckendorf's theorem using indices in an arithmetic progression

MaRDI QIDQ5077319zbMATH OpenFDO

Authors Amelia Gilson, Hadley Killen, Steven J. Miller, Nadia Razek, Joshua M. Siktar, Liza Sulkin, Tamás Lengyel

Publication date 18 May 2022

Full work available at URL https://arxiv.org/abs/2005.10396, https://www.fq.math.ca/Papers/59-4/milleretal11092020.pdf

zbMATH Keywords

indices in given arithmetic progressionunique decompositionZeckendorf's theorem

Mathematics Subject Classification ID

Other number representations (11A67) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: Zeckendorf's Theorem states that any positive integer can be uniquely decomposed into a sum of distinct, non-adjacent Fibonacci numbers. There are many generalizations, including results on existence of decompositions using only even indexed Fibonacci numbers. We extend these further and prove that similar results hold when only using indices in a given arithmetic progression. As part of our proofs, we generate a range of new recurrences for the Fibonacci numbers that are of interest in their own right.

Recommendations

• On generalized Zeckendorf decompositions and generalized golden strings
• Generalizing Zeckendorf's theorem to \(f\)-decompositions
• Gaussian distribution of the number of summands in generalized Zeckendorf decompositions in small intervals
• scientific article; zbMATH DE number 6985720
• The weak converse of Zeckendorf's theorem

Cited in

(5)

• The weak converse of Zeckendorf's theorem
• scientific article; zbMATH DE number 1391675 (Why is no real title available?)
• On generalized Zeckendorf decompositions and generalized golden strings
• A counting based proof of the generalized Zeckendorf's theorem
• On Zeckendorf Related Partitions Using the Lucas Sequence

This page was built for publication: Zeckendorf's theorem using indices in an arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5077319)