English
Related papers

Related papers: Trees are nilrigid

200 papers

We show that every automorphism $\alpha$ of a free group $F_k$ of finite rank $k$ has {\it asymptotically periodic} dynamics on $F_k$ and its boundary $\partial F_k$: there exists a positive power $\alpha^q$ such that every element of the…

Group Theory · Mathematics 2008-10-06 Gilbert Levitt , Martin Lustig

Given a finite set $A$ and a group homomorphism $\phi : H \to G$, a $\phi$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $\phi$-equivariant in the sense that…

Group Theory · Mathematics 2024-01-17 Alonso Castillo-Ramirez , Luguis de los Santos Baños

We consider the random walk in an \emph{i.i.d.} random environment on the infinite $d$-regular tree for $d \geq 3$. We consider the tree as a Cayley graph of free product of finitely many copies of $\Zbold$ and $\Zbold_2$ and define the…

Probability · Mathematics 2014-04-30 Siva Athreya , Antar Bandyopadhyay , Amites Dasgupta

In this article we study a class of shift-invariant and positive rate probabilistic cellular automata (PCA) on rooted d-regular trees $\mathbb{T}^d$. In a first result we extend the results of [10] on trees, namely we prove that to every…

Cellular Automata and Lattice Gases · Physics 2019-02-01 Bruno Kimura , Wioletta Ruszel , Cristian Spitoni

This tutorial is about cellular automata that exhibit 'cold dynamics'. By this we mean zero entropy, stabilization of all orbits, trivial asymptotic dynamics, etc. These are purely transient irreversible dynamics, but they capture many…

Cellular Automata and Lattice Gases · Physics 2022-06-17 Guillaume Theyssier

For linear non-uniform cellular automata (NUCA) which are local perturbations of linear CA over a group universe $G$ and a finite-dimensional vector space alphabet $V$ over an arbitrary field $k$, we investigate their Dedekind finiteness…

Dynamical Systems · Mathematics 2024-11-20 Xuan Kien Phung

This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state finite cellular automata (CAs) of length n under periodic boundary condition. A tool named reachability tree has been developed from de Bruijn graph…

Formal Languages and Automata Theory · Computer Science 2018-05-09 Kamalika Bhattacharjee , Sukanta Das

We say a subset $\Sigma \subseteq F_N$ of the free group of rank $N$ is \emph{spectrally rigid} if whenever $T_1, T_2 \in \cv_N$ are $\mathbb{R}$-trees in (unprojectivized) outer space for which $|\sigma|_{T_1} = |\sigma|_{T_2}$ for every…

Group Theory · Mathematics 2014-01-10 Brian Ray

We consider the range of possible dynamics of cellular automata (CA) on two-sided beta-shifts $S_\beta$. We show that any reversible CA $F:S_\beta\to S_\beta$ has an almost equicontinuous direction whenever $S_\beta$ is not sofic. This has…

Dynamical Systems · Mathematics 2020-01-28 Johan Kopra

We show that any connected locally compact group which admits an expansive automorphism is nilpotent. We also show that for any locally compact group $G$, $\alpha\in {\rm Aut}(G)$ is expansive if and only if for any $\alpha$-invariant…

Dynamical Systems · Mathematics 2020-05-14 Riddh Shah

This paper explores acylindrical actions on trees, building on previous works related to the mapping class group and projection complexes. We demonstrate that the quotient action of a $1$-acylindrical action of a group on a tree by an…

Group Theory · Mathematics 2025-03-18 Bratati Som , Daxun Wang

This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes…

Discrete Mathematics · Computer Science 2022-01-27 Nicolas Ollinger , Guillaume Theyssier

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…

Dynamical Systems · Mathematics 2007-05-23 Marcus Pivato

Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…

Formal Languages and Automata Theory · Computer Science 2014-02-18 Alex Borello , Julien Cervelle , Pascal Vanier

Causal Graph Dynamics extend Cellular Automata to arbitrary, bounded-degree, time-varying graphs. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of physics-like symmetries:…

Discrete Mathematics · Computer Science 2017-06-06 Pablo Arrighi , Simon Martiel , Simon Perdrix

We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…

Formal Languages and Automata Theory · Computer Science 2025-07-15 Niccolo' Castronuovo , Alberto Dennunzio , Luciano Margara

It is well known that a countable group admits a left-invariant total order if and only if it acts faithfully on R by orientation preserving homeomorphisms. Such group actions are special cases of group actions on simply connected…

Group Theory · Mathematics 2021-09-24 Matthew E. Horak , Melanie I. Stein

We study isometric actions of tree automorphism groups on the infinite-dimensional hyperbolic spaces. On the one hand, we exhibit a general one-parameter family of such representations and analyse the corresponding equivariant embeddings of…

Group Theory · Mathematics 2012-07-10 M. Burger , A. Iozzi , N. Monod

The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…

Quantum Physics · Physics 2021-07-09 Paolo Perinotti

This paper is about topological dynamics of cellular automata on finitely generated groups. We tackle the problem of determining for which group sensitivity to initial conditions is equivalent to the absence of equicontinuity points…

Dynamical Systems · Mathematics 2026-02-25 Jade Angela Hope Audouard , Guillaume Theyssier
‹ Prev 1 3 4 5 6 7 10 Next ›