Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.