Related papers: Glider automata on all transitive sofic shifts

In this paper we give an explicit description of the automorphism group of a primary Kodaira surface $X$ in terms of suitable liftings to the universal cover $\mathbb{C}^2$. As it happens for complex tori, the automorphism group of $X$ is…

Suppose $(X,\sigma)$ is a subshift, $P_X(n)$ is the word complexity function of $X$, and ${\rm Aut}(X)$ is the group of automorphisms of $X$. We show that if $P_X(n)=o(n^2/\log^2 n)$, then ${\rm Aut}(X)$ is amenable (as a countable,…

Let $\pi :X\rightarrow \mathbb{P}^3$ be a finite composition of blowups along smooth centers. We show that for "almost all" of such $X$, if $f\in Aut(X)$ then its first and second dynamical degrees are the same. We also construct many…

We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…

In the paper, we study behavior of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behavior of the system w.r.t. variety of word transformations performed by the system:…

Let $G$ be a group and let $V$ be an algebraic group over an algebraically closed field. We introduce algebraic group subshifts $\Sigma \subset V^G$ which generalize both the class of algebraic sofic subshifts of $V^G$ and the class of…

We show that the twisted conjugacy problem is solvable for large-type Artin groups whose outer automorphism group is finite, generated by graph automorphisms and the global inversion. This includes XXXL Artin groups whose defining graph is…

If f is a nontrivial automorphism of a thick building Delta of purely infinite type, we prove that there is no bound on the distance that f moves a chamber. This has the following group-theoretic consequence: If G is a group of…

Let G be a torsion--free abelian group of finite rank. The automorphism group Aut(G) acts on the set of maximal independent subsets of G. The orbits of this action are the isomorphism classes of indecomposable decompositions of G. G…

This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…

Let $(X_A,\sigma_A)$ be the right one-sided topological Markov shift for an irreducible matrix with entries in $\{0,1\}$, and $\Gamma_A$ the continuous full group of $(X_A,\sigma_A)$. For two irreducible matrices $A$ and $B$ with entries in…

Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…

If M is a monoid (e.g. the lattice Z^D), and G is a finite (nonabelian) group, then G^M is a compact group; a `multiplicative cellular automaton' (MCA) is a continuous transformation F:G^M-->G^M which commutes with all shift maps, and where…

In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

For a classical group $G$ over a field $F$ together with a finite-order automorphism $\theta$ that acts compatibly on $F$, we describe the fixed point subgroup of $\theta$ on $G$ and the eigenspaces of $\theta$ on the Lie algebra…

We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…

We show that every bounded automaton group can be embedded in a finitely generated, simple amenable group. The proof is based on the study of the topological full groups associated to the Schreier dynamical system of the mother groups. We…