Math-1956 · mathematics · Dynamical systems

Math-1956

Automorphism groups of full shifts

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

For $N\ge2$, put $X_N=\{0,\ldots,N-1\}^{\mathbb Z}$ with the product topology, and let $(\sigma_Nx)_j=x_{j+1}$. Define \[ \operatorname{Aut}(\sigma_N)= \{F:X_N\to X_N:F\text{ is a homeomorphism and } F\sigma_N=\sigma_NF\}, \] with group operation composition. By the finite-window description of continuous shift-commuting maps, each element and its inverse can be expressed by local rules on finitely many coordinates.

Are $\operatorname{Aut}(\sigma_2)$ and $\operatorname{Aut}(\sigma_3)$ isomorphic as abstract groups? An affirmative answer requires a bijection $\Psi$ between the groups satisfying $\Psi(FG)=\Psi(F)\Psi(G)$ for every pair of automorphisms; a negative answer requires an abstract group property distinguishing them.

No topology on the automorphism groups is part of the question. Nor is an isomorphism required to respect local rule radii, to send the distinguished shift to the other shift, or to be induced by a homeomorphism between the underlying configuration spaces. These extra requirements would change the target. The alphabets are fixed at two and three symbols, and both shifts are two-sided. Thus the problem compares the complete algebraic symmetry groups of the two systems, rather than asking whether the shifts themselves are dynamically conjugate or whether either symmetry group embeds into the other.

Short English statement

Are the abstract automorphism groups of the full binary and ternary shifts isomorphic?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.