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

preprint2022arXivOpen access

Abstract

For any non-erasing free monoid morphism σ:A∗→B∗σ: \cal A^* \to \cal B^*, and for any subshift X⊂AZX \subset \cal A^\Z and its image subshift Y=σ(X)⊂BZY = σ(X) \subset \cal B^\Z, the associated complexity functions pXp_X and pYp_Y are shown to satisfy: there exist constants c,d,C>0c, d, C > 0 such that c⋅pX(d⋅n)  ≤  pY(n)  ≤  C⋅pX(n)c \cdot p_X(d \cdot n) \,\, \leq \,\, p_Y(n) \,\, \leq \,\, C \cdot p_X(n) holds for all sufficiently large integers n∈Nn \in \N, provided that σσ is recognizable in XX. If σσ is in addition letter-to-letter, then pYp_Y belongs to Θ(pX)Θ(p_X) (and conversely). Otherwise, however, there are examples where pXp_X is not in O(pY)\cal O(p_Y). It follows that in general the value hXh_X of the topological entropy of XX is not preserved when applying a morphism σσ to XX, even if σσ is recognizable in XX. As a consequence, there is no meaningful way to define the topological entropy of a current on a free group FNF_N; only the distinction of currents μμ with topological entropy $h_{\tiny\supp(μ)} = 0$ and $h_{\tiny\supp(μ)} > 0$ is well defined.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.