On the expansions of real numbers in two integer bases
Yann Bugeaud, Dong Han Kim

TL;DR
This paper proves that for two multiplicatively independent bases, an irrational number cannot have both its base-$r$ and base-$s$ expansions exhibit low complexity, such as both being Sturmian words, highlighting limitations in simultaneous simple expansions.
Contribution
It establishes a new limitation on the complexity of simultaneous expansions of irrationals in multiplicatively independent bases.
Findings
Cannot have both expansions as Sturmian words
Low block complexity cannot occur simultaneously in both expansions
Provides a new link between number theory and combinatorics on words
Abstract
Let and be multiplicatively independent positive integers. We establish that the -ary expansion and the -ary expansion of an irrational real number, viewed as infinite words on and , respectively, cannot have simultaneously a low block complexity. In particular, they cannot be both Sturmian words.
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
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Algorithms and Data Compression
