Related papers: A weakly universal cellular automaton in the hepta…
In this paper we study the family of two-state Totalistic Freezing Cellular Automata (TFCA) defined over the triangular and square grids with von Neumann neighborhoods. We say that a Cellular Automaton is Freezing and Totalistic if the…
We study invariant Hermitian forms on a conformal vertex algebra and on their (twisted) modules. We establish existence of a non-zero invariant Hermitian form on an arbitrary $W$-algebra. We show that for a minimal simple $W$-algebra…
Under a suitable hypothesis, we construct a full set of pairwise orthogonal maximal vectors in $V^{\otimes n}$, where $V=V(1)$ is the simple module of highest weight $1$ for the quantized enveloping algebra $\mathbf{U}(\mathfrak{sl}_2)$. We…
We study the computational complexity of determining whether a cellular automaton is sensitive to initial conditions. We show that this problem is $\Pi^0_2$-complete in dimension 1 and $\Sigma^0_3$-complete in dimension 2 and higher. This…
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial…
Recursive equations for the number of cells with nonzero values at $n$-th step for some two-dimensional reversible second-order cellular automata are proved in this work. Initial configuration is a single cell with the value one and all…
We consider a left permutive cellular automaton Phi, with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there…
We describe an iterative algorithm to construct an unstructured tessellation of simplices (irregular tetrahedra in 3-dimensions) to approximate an arbitrary function to a desired precision by interpolation. The method is applied to the…
Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous work we proved a simple No-go Theorem which…
In this article we prove the strict monotonicity of the spectral radius of weakly irreducible nonnegative tensors. As an application, we give a necessary and sufficient condition for an interval hull of tensors to be contained in the set of…
In this paper we study monotone cellular automata in $d$ dimensions. We develop a general method for bounding the growth of the infected set when the initial configuration is chosen randomly, and then use this method to prove a lower bound…
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d…
Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and…
In this paper, we consider the twisted Hamiltonian extended affine Lie algebra (THEALA). We classify the irreducible integrable modules for these Lie algebras with finite-dimensional weight spaces when the finite-dimensional center acts…
In this paper, we consider weak solutions of the Euler-Lagrange equation to a variational energy functional modeling the geometrically nonlinear Cosserat micropolar elasticity of continua in dimension three, which is a system coupling…
The fixed point construction is a method for designing tile sets and cellular automata with highly nontrivial dynamical and computational properties. It produces an infinite hierarchy of systems where each layer simulates the next one. The…
In this paper, we develop a new cellular automata-based linear model for several nonlinear pseudorandom number generators with practical applications in symmetric cryptography. Such a model generates all the solutions of linear binary…
We study some non-semisimple representations of affine Temperley--Lieb algebras and related cellular algebras. In particular, we classify extensions between simple standard modules. Moreover, we construct a completion which is an infinite…
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,…
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on…