Combinatorial properties of lazy expansions in Cantor real bases
C\'elia Cisternino

TL;DR
This paper explores the combinatorial and dynamical properties of lazy expansions in Cantor bases, generalizing classical algorithms, and characterizes when these expansions form sofic shifts, with specific results for periodic Cantor bases.
Contribution
It introduces a generalized lazy expansion algorithm for Cantor bases, provides a Parry-like criterion, and characterizes soficity in periodic Cantor bases, extending previous work on greedy expansions.
Findings
Lazy expansions are obtained by flipping greedy expansion digits.
A Parry-like criterion characterizes lazy expansion sequences.
Lazy shift is sofic iff all quasi-lazy expansions are ultimately periodic.
Abstract
The lazy algorithm for a real base is generalized to the setting of Cantor bases introduced recently by Charlier and the author. To do so, let be the greatest real number that has a -representation such that each letter belongs to . This paper is concerned with the combinatorial properties of the lazy -expansions, which are defined when . As an illustration, Cantor bases following the Thue-Morse sequence are studied and a formula giving their corresponding value of is proved. First, it is shown that the lazy -expansions are obtained by "flipping" the digits of the greedy -expansions. Next, a Parry-like…
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
TopicsComputability, Logic, AI Algorithms · Advanced Algebra and Logic · Advanced Topology and Set Theory
