2000 character limit reached
Periodic representations in Salem bases
Published 19 Dec 2018 in math.NT | (1812.08228v1)
Abstract: We prove that all algebraic bases $\beta$ allow an eventually periodic representations of the elements of $\mathbb Q(\beta)$ with a finite alphabet of digits $\mathcal A$. Moreover, the classification of bases allowing that those representations have the so-called weak greedy property is given. The decision problem whether a given pair $(\beta,\mathcal A)$ allows eventually periodic representations proves to be rather hard, for it is equivalent to a topological property of the attractor of an iterated function system.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.