We obtain the following embedding theorem for symbolic dynamical systems. Let G be a countable amenable group with the comparison property. Let X be a strongly aperiodic subshift over G. Let Y be a strongly irreducible shift of finite type over G that has no global period, meaning that the shift action is faithful on Y. If the topological entropy of X is strictly less than that of Y and Y contains at least one factor of X, then X embeds into Y. This result partially extends the classical result of Krieger when $G = \mathbb {Z}$ and the results of Lightwood when $G = \mathbb {Z}^d$ for $d \geq 2$. The proof relies on recent developments in the theory of tilings and quasi-tilings of amenable groups.

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. In each case, the distortion element roughly corresponds to the SMART machine of Cassaigne, Ollinger, and Torres-Avilés [A small minimal aperiodic reversible Turing machine. J. Comput. System Sci. 84 (2017), 288–301].

The class of $\lambda $-synchronizing subshifts generalizes the class of irreducible sofic shifts. A $\lambda $-synchronizing subshift can be presented by a certain $\lambda $-graph system, called the $\lambda $-synchronizing $\lambda $-graph system. The $\lambda $-synchronizing $\lambda $-graph system of a $\lambda $-synchronizing subshift can be regarded as an analogue of the Fischer cover of an irreducible sofic shift. We will study algebraic structure of the ${C}^{\ast } $-algebra associated with a $\lambda $-synchronizing $\lambda $-graph system and prove that the stable isomorphism class of the ${C}^{\ast } $-algebra with its Cartan subalgebra is invariant under flow equivalence of $\lambda $-synchronizing subshifts.

A Martin-Löf random sequence is an infinite binary sequence with the property that every initial segment σ has prefix-free Kolmogorov complexity K(σ) at least ∣σ∣ − c, for some constant c ϵ ω. Informally, initial segments of Martin-Löf randoms are highly complex in the sense that they are not compressible by more than a constant number of bits. However, all Martin-Löf randoms necessarily have contiguous substrings of arbitrarily low complexity. If we demand that all substrings of a sequence be uniformly complex, then we arrive at the notion of shift-complex sequences. In this paper, we collect some of the existing results on these sequences and contribute two new ones. Rumyantsev showed that the measure of oracles that compute shift-complex sequences is zero. We strengthen this result by proving that the Martin-Löf random sequences that do not compute shift-complex sequences are exactly the incomplete ones, in other words, the ones that do not compute the halting problem. In order to do so, we make use of the characterization by Franklin and Ng of the class of incomplete Martin-Löf randoms via a notion of randomness called difference randomness. Turning to the power of shift-complex sequences as oracles, we show that there are shift-complex sequences that do not compute Martin-Löf random (or even Kurtz random) sequences.