Hostname: page-component-74656f9884-qr5l4 Total loading time: 0 Render date: 2026-11-05T12:25:14.464Z Has data issue: false hasContentIssue false

Decidability of the isomorphism problem between multidimensional substitutive subshifts

Published online by Cambridge University Press:  19 November 2024

CHRISTOPHER CABEZAS*
Affiliation:
Department of Mathematics, University of Liège, Allée de la découverte 12 (B37), B-4000 Liège, Belgium (e-mail: j.leroy@uliege.be)
JULIEN LEROY
Affiliation:
Department of Mathematics, University of Liège, Allée de la découverte 12 (B37), B-4000 Liège, Belgium (e-mail: j.leroy@uliege.be)
Rights & Permissions [Opens in a new window]

Abstract

An important question in dynamical systems is the classification problem, that is, the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive subshifts generated by morphisms with uniform support. We prove that it is decidable to check whether two minimal aperiodic substitutive subshifts are isomorphic. The strategy followed in this work consists of giving a complete description of the factor maps between these subshifts. Then, we deduce some interesting consequences on coalescence, automorphism groups, and the number of aperiodic symbolic factors of substitutive subshifts. We also prove other combinatorial results on these substitutions, such as the decidability of defining a subshift, the computability of the constant of recognizability, and the conjugacy between substitutions with different supports.

Information

Type
Original Article
Copyright
© The Author(s), 2024. Published by Cambridge University Press
Figure 0

Figure 1 A visual representation of Claim 1 with the triangular Thue–Morse substitution (Example 2.1). The black points on the left represent the points in $F_{4}$, and $F_{5}$ on the right. The blue points (triangles) represent the points $(-2,5)$ in $F_{4}$ (left) and $(-4,10)=2\cdot (-2,5)+(0,0)$ in $F_{5}$ (right). Finally, the red points (squares) on the left represent the set $(-2,5)+C_{L,F_{1}}+K$ and $(-4,10)+C_{L,F_{1}}+L(K)+F_{1}$ on the right.

Figure 1

Figure 2 The graph for the classical one-dimensional case.

Figure 2

Figure 3 The graph $\mathcal {G}(L,F_{1},K)$ for the triangular Thue–Morse. Outgoing edges from vertex $(0,0)$ are not represented as they are self-loops.

Figure 3

Figure 4 The eight patterns in $\mathcal {L}_{K_{\Delta TM}}(X_{\sigma _{\Delta TM}})$.

Figure 4

Figure 5 A square substitution conjugate to the triangular Thue–Morse substitution.

Figure 5

Figure 6 The patterns that generate the eight fixed points of $\sigma _{1 }^{2}$.

Figure 6

Figure 7 Illustration of a forbidden situation given by the repulsion property (Proposition 5.5).

Figure 7

Figure 8 Illustration of the pattern $\zeta ^{n}(\texttt {u}_{n})$ around the coordinates $L_{\zeta }^{n}(\boldsymbol {a}_{n})$ (black, left) and $\boldsymbol {j}_{n}-\boldsymbol {f}_{n}$ (blue, right).

Figure 8

Figure 9 Illustration of the patterns $\zeta ^{n}(\texttt {w}_{n})$, $\zeta ^{n}(\texttt {u}_{n})$, and $\zeta ^{n}(\texttt {v}_{n})$ around $\boldsymbol {j}_{n}-\boldsymbol {f}_{n}$.

Figure 9

Figure 10 Illustration of the patterns $\zeta ^{n}(\texttt {w})$ and $\texttt {a}_{n}$ around $(\boldsymbol {j}_{n}-\boldsymbol {f}_{n})$.

Figure 10

Figure 11 Illustration of the patterns $\zeta ^{m-n}(\texttt {a}_{n})$ in $L_{\zeta }^{m-n}(\boldsymbol {j}_{n})$.