Distortion element in the automorphism group of a full shift

08/01/2022
by   Antonin Callard, et al.
0

We show that there is a distortion element in a finitely-generated subgroup G of the automorphism group of the full shift, namely an element of infinite order whose word norm grows polylogarithmically. As a corollary, we obtain a lower bound on the entropy dimension of any subshift containing a copy of G, and that a sofic shift's automorphism group contains a distortion element if and only if the sofic shift is uncountable. We obtain also that groups of Turing machines and the higher-dimensional Brin-Thompson groups mV admit distortion elements; in particular, 2V (unlike V) does not admit a proper action on a CAT(0) cube complex. The distortion element is essentially the SMART machine.

READ FULL TEXT
research
08/28/2018

Undecidable word problem in subshift automorphism groups

This article studies the complexity of the word problem in groups of aut...
research
03/30/2023

The group of reversible Turing machines: subgroups, generators and computability

We study an abstract group of reversible Turing machines. In our model, ...
research
03/12/2020

Four heads are better than three

We construct recursively-presented finitely-generated torsion groups whi...
research
03/24/2021

Homomorphic encoders of profinite abelian groups

Let {G_i :i∈} be a family of finite Abelian groups. We say that a subgro...
research
04/25/2023

Semigroup algorithmic problems in metabelian groups

We consider semigroup algorithmic problems in finitely generated metabel...
research
11/30/2021

Homomorphic encoders of profinite abelian groups II

Let {G_i :i∈} be a family of finite Abelian groups. We say that a subgro...
research
02/12/2023

The Identity Problem in ℤ≀ℤ is decidable

We consider semigroup algorithmic problems in the wreath product ℤ≀ℤ. Ou...

Please sign up or login with your details

Forgot password? Click here to reset