Numbers with countable expansions in base of generalized golden ratios
Abstract
Sidorov and Vershik showed that in base G=5+12 and with the digits 0,1 the numbers x=nG ~( mod 1) have 0 expansions for any n∈Z, while the other elements of (0, 1G-1) have 20 expansions. In this paper, we generalize this result to the generalized golden ratio base β=G(m). With the digit-set \0,1,·s, m\, if m=2k+1, G(m)=k+1+k2+6k+52, the numbers x=pβ+q(k+1)n∈(0, mβ-1) (where n, p, q∈Z) have 0 expansions, while the other elements of (0, mβ-1) have 20 expansions; if m=2k, G(m)=k+1, the numbers with countably many expansions are p(k+1)n∈(0, 2) ~(n, p∈N\0\). This solves an open question by Baker.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.