Related papers: Trees are nilrigid

We consider expansive group actions on a compact metric space containing a special fixed point denoted by $0$, and endomorphisms of such systems whose forward trajectories are attracted toward $0$. Such endomorphisms are called…

We classify the irreducible unitary representations of closed simple groups of automorphisms of trees acting $2$-transitively on the boundary and whose local action at every vertex contains the alternating group. As an application, we…

We study the generic limit sets of one-dimensional cellular automata, which intuitively capture their asymptotic dynamics while discarding transient phenomena. As our main results, we characterize the automata whose generic limit set is a…

For an arbitrary group $G$ and arbitrary set $A$, we define a monoid structure on the set of all uniformly continuous functions $A^G\to A$ and then we show that it is naturally isomorphic to the monoid of cellular automata $\mathrm{CA}(G,…

We show that tree almost automorphism groups, including Neretin groups, satisfy the analogue of the $F_\infty$-finiteness condition in the world of totally disconnected groups: They possess a cellular action on a contractible cellular…

We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree…

For non-uniform cellular automata (NUCA) with finite memory over an arbitrary universe with multiple local transition rules, we show that pointwise nilpotency, pointwise periodicity, and pointwise eventual periodicity properties are…

Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…

Motivated by the search for idempotent cellular automata (CA), we study CA that act almost as the identity unless they read a fixed pattern $p$. We show that constant and symmetrical patterns always produce idempotent CA, and we…

Let $G$ be a group and let $A$ be a finite-dimensional vector space over an arbitrary field $K$. We study finiteness properties of linear subshifts $\Sigma \subset A^G$ and the dynamical behavior of linear cellular automata $\tau \colon…

We develop a notion of groups that act acylindrically and non-elementarily on simplicial trees, which we call acylindrically arboreal groups. We then prove a complete classification of when graph products of groups and the fundamental…

We prove a conjecture of P. Guillon and G. Richard by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S^Z^d for all d. We also briefly discuss nilpotency on other subshifts, and show that…

Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…

We study the sofic tree shifts of $A^{\Sigma^*}$, where $\Sigma^*$ is a regular rooted tree of finite rank. In particular, we give their characterization in terms of unrestricted Rabin automata. We show that if $X \subset A^{\Sigma^*}$ is a…

Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…

In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata…

A loop is automorphic if its inner mappings are automorphisms. Using so-called associated operations, we show that every commutative automorphic loop of odd prime power order is centrally nilpotent. Starting with anisotropic planes in the…

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity,…

An $\omega$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $\omega$-tree-automatic structures. We prove…