Words and morphisms with Sturmian erasures
Fabien Durand (LAMFA), Adel Guerziz (LAMFA), Michel Koskas (LAMFA)

TL;DR
This paper studies words over a three-letter alphabet where removing any one letter yields a Sturmian word, explores their connection to billiard trajectories, and proves the associated morphism monoid is not finitely generated.
Contribution
It introduces the concept of words with Sturmian erasures, links them to billiard trajectories, and proves the non-finite generation of their morphism monoid.
Findings
Words with Sturmian erasures are linked to billiard trajectories in the cube.
The monoid of morphisms preserving these words is not finitely generated.
The paper characterizes a large family of such words.
Abstract
We say is a word with Sturmian erasures if for any the word obtained erasing all in is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of billiards in the cube. We prove that the monoid of morphisms mapping all words with Sturmian erasures to words with Sturmian erasures is not finitely generated.
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 · Mathematical Dynamics and Fractals · Computability, Logic, AI Algorithms
