Related papers: A weakly universal cellular automaton in the hepta…
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…
A new approach to prove weak convergence of random polytopes on the space of compact convex sets is presented. This is used to show that the profile of the rescaled Schl\"afli random cone of a random conical tessellation generated by $n$…
We show that in a weak globular $\omega$-category, all composition operations are equivalent and commutative for cells with sufficiently degenerate boundary, which can be considered a higher-dimensional generalisation of the Eckmann-Hilton…
We rigorously prove a form of disorder-resistance for a class of one-dimensional cellular automaton rules, including some that arise as boundary dynamics of two-dimensional solidification rules. Specifically, when started from a random…
We show that any weakly separated Bessel system of model spaces in the Hardy space on the unit disc is a Riesz system and we highlight some applications to interpolating sequences of matrices. This will be done without using the recent…
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…
Failure to find homogeneous scalar unitary cellular automata (CA) in one dimension led to consideration of only ``approximately unitary'' CA---which motivated our recent proof of a No-go Lemma in one dimension. In this note we extend the…
In this article, I propose a systematic method for the inverse ultra-discretization of cell automata using a functionally complete operation. We derive difference equations for the 256 kinds of elementary cellular automata(ECA) introduced…
We propose an asymmetric modification of the sand-pile-like cellular automaton for earthquake modeling. The cumulative event distribution is shown to be dependent on the asymmetry parameter.
In this paper we consider the variational setting for SPDE on a Gelfand triple $(V, H, V^*)$. Under the standard conditions on a linear coercive pair $(A,B)$, and a symmetry condition on $A$ we manage to extrapolate the classical…
Tensor network states provide an efficient class of states that faithfully capture strongly correlated quantum models and systems in classical statistical mechanics. While tensor networks can now be seen as becoming standard tools in the…
For a group $G$ and a finite set $A$, a cellular automaton (CA) is a transformation $\tau : A^G \to A^G$ defined via a finite memory set $S \subseteq G$ and a local map $\mu : A^S \to A$. Although memory sets are not unique, every CA admits…
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for…
In this paper, we consider a regular tessellation of the Euclidean plane and the sequence of its geometric scalings by negative powers of a fixed integer. We generate iteratively random sets as the union of adjacent tiles from these…
Cellular automata with memory (CAM) are widely used in fields such as image processing, pattern recognition, simulation, and cryptography. The invertibility of CAM is generally considered to be chaotic. Paper [Invertible behavior in…
We apply Hilbert module methods to show that normal completely positive maps admit weak tensor dilations. Appealing to a duality between weak tensor dilations and extensions of CP-maps, we get an existence proof for certain extensions. We…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
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,…
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…
The Cellular Automaton (CA) modeling and simulation of solid dynamics is a long-standing difficult problem. In this paper we present a new two-dimensional CA model for solid dynamics. In this model the solid body is represented by a set of…