Related papers: The Myhill property for cellular automata on amena…
In this paper we show that for every congruent monotileable amenable group $G$ and for every metrizable Choquet simplex $K$, there exists a minimal $G$-subshift, which is free on a full measure set, whose set of invariant probability…
We prove that the semigroup generated by a reversible Mealy automaton contains a free subsemigroup of rank two if and only if it contains an element of infinite order.
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…
Let M be a monoid (e.g. the lattice Z^D), and A an abelian group. A^M is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. Let mu be a (possibly…
We characterize amenability of subspaces of $C(S)$, where $S$ is a semitopological semigroup, in terms of fixed point properties of nonexpansive actions. In particular, we give a complete characterization of a semitopological semigroup with…
In this paper we construct a cellular complex which is an infinite analogue to Stasheff's associahedra. We prove that it is contractible and state that its (combinatorial) automorphism group is isomorphic to a semi-direct product of R.J.…
For a connected semisimple Lie group $G$ we describe an explicit collection of correspondences between the admissible dual of $G$ and the admissible dual of the Cartan motion group associated with $G$. We conjecture that each of these…
For every non-trivial finite abelian group $A$, we exhibit a bireversible automaton generating the lamplighter group $A \wr \mathbb{Z}$.
We show that on groups generated by bounded activity automata, every symmetric, finitely supported probability measure has the Liouville property. More generally we show this for every group of automorphisms of bounded type of a rooted…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as…
Reversibility of a one-dimensional finite cellular automaton (CA) is dependent on lattice size. A finite CA can be reversible for a set of lattice sizes. On the other hand, reversibility of an infinite CA, which is decided by exploring the…
This paper has been withdrawn by the authors due to a mistake in the proof and a corresponding incorrect result. A correct rigorous analysis of a similar model is presented in ``Spiral Model: a cellular automaton with a discontinuous glass…
We show that, when $A$ is a separable C*-algebra, every countably generated Hilbert $A$-module is projective (with bounded module maps as morphisms). We also study the approximate extensions of bounded module maps. In the case that $A$ is a…
Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…
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…
Let $S$ be an inverse semigroup with the set of idempotents $E$. In this paper we define the module super-amenability of a Banach algebra which is a Banach module over another Banach algebra with compatible actions, and show that when $E$…
In adjoint reductive groups $H$ of type $\mathsf{D}$ we show that for every semisimple element $s$, its centralizer splits over its connected component, i.e., $C_H(s) = C_H(s)^\circ \rtimes \check A$ for some complement $\check A$ with…
The $\mu$-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to in- finity. In this article, for a given subshift in a large class of subshifts, we…