Uniform Bounds for Digit-Appending Fibonacci Walks
Scott Duke Kominers

TL;DR
This paper establishes uniform bounds on the ability to generate Fibonacci sequences through digit appending in various bases, demonstrating impossibility results that are independent of the base and extend to Lucas sequences.
Contribution
It provides a base-independent proof of bounds on Fibonacci walks with digit appending, extending results to Lucas sequences and improving understanding of sequence generation constraints.
Findings
Impossible to 'walk to infinity' with limited digit appending in any base
Derived a uniform bound L ≤ 2N log_φ b + O(1) for Fibonacci walks
Extended the approach to certain Lucas sequences
Abstract
Building on the work of Miller et al. [Fibonacci Quarterly, 2022], we show that it is impossible to "walk to infinity" along the Fibonacci sequence in any integer base when at most digits are appended per step. Our proof method is base-independent, yielding the bound \[L \;\leq\; 2N\log_\varphi b \,+\, O(1),\] uniformly in the starting term, without relying on base-specific periodicity computations (here, ). Our approach extends to certain Lucas sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Advanced Combinatorial Mathematics · semigroups and automata theory
