Related papers: No Tits alternative for cellular automata

Given a group action on a finite-dimensional CAT(0) cube complex, we give a simple criterion phrased purely in terms of cube stabilisers that ensures that the group satisfies the strong Tits alternative, provided that each vertex stabiliser…

We prove that if a subgroup $H$ of the automorphism group $\mathrm{Aut}(\Sigma^{\mathbb{Z}})$ of a non-trivial full shift acts on points of finite support with a free orbit, then for every finitely-generated abelian group $A$, the abstract…

Topological transitivity is a fundamental notion in topological dynamics and is widely regarded as a basic indicator of global dynamical complexity. For general cellular automata, topological transitivity is known to be undecidable. By…

We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…

We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…

In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to "largeness". The first property is ID…

Group cellular automata are continuous, shift-commuting endomorphisms of $G^\mathbb{Z}$, where $G$ is a finite group. We provide an easy-to-check characterization of expansivity for group cellular automata on abelian groups and we prove…

The Tits alternative for Out(F_n) is reduced to the case where all elements in the subgroup under consideration grow polynomially.

We compute an explicit representation of the (topological) automorphism group or a particular Toeplitz subshift. The automorphism group is a (non-finitely generated) subgroup of rational numbers under addition and the shift map corresponds…

We present sufficient conditions for the triviality of the automorphism group of regular Toeplitz subshifts and give a broad class of examples from the class of $\mathcal{B}$-free subshifts satisfying them, extending [10]. On the other hand…

We study the outer automorphism group of a right-angled Artin group A_G in the case where the defining graph G is connected and triangle-free. We give an algebraic description of Out(A_G) in terms of maximal join subgraphs in G and prove…

We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…

In this paper, we study avoshifts and unishifts on $\mathbb{Z}^d$. Avoshifts are subshifts where for each convex set $C$, and each vector $v$ such that $C \cup \{\vec v\}$ is also convex, the set of valid extensions of globally valid…

Following previous work of the second author, we establish more properties of groups of circle homeomorphisms which admit invariant laminations. In this paper, we focus on a certain type of such groups-so-called pseudo-fibered groups, and…

In this article, we further explore the nature of a connection between the groups of automorphisms of full shift spaces and the groups of outer automorphisms of the Higman--Thompson groups $\{G_{n,r}\}$. We show that the quotient of the…

We show that on the four-symbol full shift, there is a finitely generated subgroup of the automorphism group whose action is (set-theoretically) transitive of all orders on the points of finite support, up to the necessary caveats due to…

We give some optimal size generating sets for the group generated by shifts and local permutations on the binary full shift. We show that a single generator, namely the fully asynchronous application of the elementary cellular automaton 57…

The study of the existence of free groups in skew linear groups have been begun since the last decades of the 20-th century. The starting point is the theorem of Tits (1972), now often is referred as Tits' Alternative, stating that every…

Many decision problems concerning cellular automata are known to be decidable in the case of algebraic cellular automata, that is, when the state set has an algebraic structure and the automaton acts as a morphism. The most studied cases…

We show that for every integer $d$, there is a constant $N(d)$ such that if $K$ is any field and $F$ is a finite subset of $GL_d(K)$, which generates a non amenable subgroup, then $F^{N(d)}$ contains two elements, which freely generate a…