How do topological entropy and factor complexity behave under monoid morphisms and free group basis changes ?
Martin Lustig

TL;DR
This paper investigates how topological entropy and factor complexity of subshifts behave under free monoid morphisms and basis changes, revealing that entropy is generally not preserved and proposing implications for currents on free groups.
Contribution
It establishes bounds on complexity functions under recognizable monoid morphisms and shows entropy invariance fails in general, impacting the understanding of currents in free groups.
Findings
Complexity functions are bounded and comparable under recognizable morphisms.
Topological entropy is not preserved under general morphisms.
A meaningful entropy concept for currents on free groups is limited to certain cases.
Abstract
For any non-erasing free monoid morphism , and for any subshift and its image subshift , the associated complexity functions and are shown to satisfy: there exist constants such that holds for all sufficiently large integers , provided that is recognizable in . If is in addition letter-to-letter, then belongs to (and conversely). Otherwise, however, there are examples where is not in . It follows that in general the value of the topological entropy of is not preserved when applying a morphism to , even if is recognizable in . As a consequence, there is no meaningful way to define the…
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
TopicsElasticity and Wave Propagation · Engineering Diagnostics and Reliability
