English
Related papers

Related papers: Glider automata on all transitive sofic shifts

200 papers

Let A^Z be the Cantor space of bi-infinite sequences in a finite alphabet A, and let sigma be the shift map on A^Z. A `cellular automaton' is a continuous, sigma-commuting self-map Phi of A^Z, and a `Phi-invariant subshift' is a closed,…

Dynamical Systems · Mathematics 2007-05-23 Marcus Pivato

Gottschalk's surjunctivity conjecture for a group $G$ states that it is impossible for cellular automata (CA) over the universe $G$ with finite alphabet to produce strict embeddings of the full shift into itself. A group universe $G$…

Dynamical Systems · Mathematics 2026-03-17 Xuan Kien Phung

We present a new Life-like cellular automaton (CA) capable of logic universality -- the X-rule. The CA is 2D, binary, with a Moore neighborhood and $\lambda$ parameter similar to the game-of-Life, but is not based on birth/survival and is…

Cellular Automata and Lattice Gases · Physics 2017-09-11 José Manuel Gómez Soto , Andrew Wuensche

We say that a group G acts infinitely transitively on a set X if for every integer m the induced diagonal action of G is transitive on the cartesian mth power of X with the diagonals removed. We describe three classes of affine algebraic…

Algebraic Geometry · Mathematics 2012-10-10 I. V. Arzhantsev , K. Kuyumzhiyan , M. Zaidenberg

The Stranded Cellular Automata (SCA) model consists of a grid of cells which can each contain between zero and two strands apiece and two turning rules that control when strands turn and when they cross. While patterns on this model have…

Dynamical Systems · Mathematics 2026-01-30 Alexa Renner

We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…

Dynamical Systems · Mathematics 2014-12-02 Ethan Coven , Reem Yassawi

In this paper, partly based on Zachos' PhD thesis, we show that the geodesic X-ray transform is stably invertible near infinity on a class of asymptotically conic manifolds which includes perturbations of Euclidean space. In particular…

Differential Geometry · Mathematics 2024-10-02 András Vasy , Evangelie Zachos

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…

Formal Languages and Automata Theory · Computer Science 2012-10-01 Tullio Ceccherini-Silberstein , Michel Coornaert , Francesca Fiorenzi , Zoran Sunic

In this article we study automorphisms of Toeplitz subshifts. Such groups are abelian and any finitely generated torsion subgroup is finite and cyclic. When the complexity is non superlinear, we prove that the automorphism group is, modulo…

Dynamical Systems · Mathematics 2017-06-15 Sebastián Donoso , Fabien Durand , Alejandro Maass , Samuel Petite

To any automorphism, $\alpha$, of a totally disconnected, locally compact group, $G$, there is associated a compact, $\alpha$-stable subgroup of $G$, here called the \emph{nub} of $\alpha$, on which the action of $\alpha$ is topologically…

Group Theory · Mathematics 2019-02-20 George Willis

We introduce invertible subalgebras of local operator algebras on lattices. An invertible subalgebra is defined to be one such that every local operator can be locally expressed by elements of the inveritible subalgebra and those of the…

Mathematical Physics · Physics 2023-11-06 Jeongwan Haah

In this article we study the automorphism group ${\rm Aut}(X,\sigma)$ of subshifts $(X,\sigma)$ of low word complexity. In particular, we prove that Aut$(X,\sigma)$ is virtually $\mathbb{Z}$ for aperiodic minimal subshifts and certain…

Dynamical Systems · Mathematics 2015-07-13 Sebastián Donoso , Fabien Durand , Alejandro Maass , Samuel Petite

The group of automorphisms of a symbolic dynamical system is countable, but often very large. For example, for a mixing subshift of finite type, the automorphism group contains isomorphic copies of the free group on two generators and the…

Dynamical Systems · Mathematics 2015-09-30 Van Cyr , Bryna Kra

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…

Cellular Automata and Lattice Gases · Physics 2008-12-02 Valeriy Bulitko

Let $G$ be a countable monoid and let $A$ be an Artinian group (resp. an Artinian module). Let $\Sigma \subset A^G$ be a closed subshift which is also a subgroup (resp. a submodule) of $A^G$. Suppose that $\Gamma$ is a finitely generated…

Dynamical Systems · Mathematics 2022-02-01 Xuan Kien Phung

Let $G$ be a finitely generated polyfree group. If $G$ has nonzero Euler characteristic then we show that $Aut(G)$ has a finite index subgroup in which every automorphism has infinite Reidemeister number. For certain $G$ of length 2, we…

Group Theory · Mathematics 2015-03-13 Alexander Fel'shtyn , Daciberg Gonçalves , Peter Wong

A one-sided shift of finite type $(X_A,\sigma_A)$ determines on the one hand a Cuntz-Krieger algebra $\mathcal{O}_A$ with a distinguished abelian subalgebra $\mathcal{D}_A$ and a certain completely positive map $\tau_A$ on $\mathcal{O}_A$.…

Operator Algebras · Mathematics 2021-05-21 Kevin Aguyar Brix , Toke Meier Carlsen

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…

Dynamical Systems · Mathematics 2023-09-13 Robbert Fokkink , Dan Rust , Ville Salo

We show that for any continuous monotonic fixed-point free automorphism $f$ on a $\sigma$-compact subgroup $G\subset \mathbb R$ there exists a binary operation $+_f$ such that $\langle G, +_f\rangle$ is a topological group topologically…

General Topology · Mathematics 2016-06-17 Raushan Buzyakova

The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram, ie the infinite sequence of states of a particular cell of a configuration; in the language of symbolic dynamics one…

Dynamical Systems · Mathematics 2007-05-23 Julien Cervelle , Enrico Formenti , Pierre Guillon