Papers
Topics
Authors
Recent
Search
2000 character limit reached

The structure of base phi expansions

Published 15 May 2023 in math.NT | (2305.08349v1)

Abstract: In the base phi expansion any natural number is written uniquely as a sum of powers of the golden mean with coefficients 0 and 1, where it is required that the product of two consecutive digits is always 0. We tackle the problem of describing how these expansions look like. We classify the positive parts of the base phi expansions according to their suffices, and the negative parts according to their prefixes, specifying the sequences of occurrences of these digit blocks. Here the situation is much more complex than for the Zeckendorf expansions, where any natural number is written uniquely as a sum of Fibonacci numbers with coefficients 0 and 1, where, again, it is required that the product of two consecutive digits is always 0. In a previous work we have classified the Zeckendorf expansions according to their suffices. It turned out that if we consider the suffices as labels on the Fibonacci tree, then the numbers with a given suffix in their Zeckendorf expansion appear as generalized Beatty sequences in a natural way on this tree. We prove that the positive parts of the base phi expansions are a subsequence of the sequence of Zeckendorf expansions, giving an explicit formula in terms of a generalized Beatty sequence. The negative parts of the base phi expansions no longer appear lexicographically. We prove that all allowed digit blocks appear, and determine the order in which they do appear.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.