Related papers: Symmetric Nonlinear Cellular Automata as Algebraic…
Results from helically symmetric scalar field models and first results from a convergent helically symmetric binary neutron star code are reported here; these are models stationary in the rotating frame of a source with constant angular…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
We study intrinsic simulations between cellular automata and introduce a new necessary condition for a CA to simulate another one. Although expressed for general CA, this condition is targeted towards surjective CA and especially linear…
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the…
In this work, pseudorandom sequence generators based on finite fields have been analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear sequence generators has been modelled in terms of linear…
The cellular automata (CA) approach to traffic modeling is extended to allow for spatially homogeneous steady state solutions that cover a two dimensional region in the flow-density plane. Hence these models fulfill a basic postulate of a…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
We investigate some general properties of algebraic cellular automata, i.e., cellular automata over groups whose alphabets are affine algebraic sets and which are locally defined by regular maps. When the ground field is assumed to be…
In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…
We use a quantum loop expansion to derive sum rule constraints on polarized photoabsorption cross sections in the Standard Model, generalizing earlier results obtained by Altarelli, Cabibbo, and Maiani. We show that the logarithmic integral…
We present cosmological constraints for the flat $\Lambda$CDM model, including the sum of neutrino masses, by performing a multi-probe analysis of a total of 13 tomographic auto- and cross-angular power spectra. This is achieved by…
Symplectic symmetry approach to clustering (SSAC) in atomic nuclei, recently proposed, is modified and further developed in more detail. It is firstly applied to the light two-cluster $^{20}$Ne + $\alpha$ system of $^{24}$Mg, the latter…
We continue the study of asynchrony immunity in cellular automata (CA), which can be considered as a weaker version of correlation immunity in the context of vectorial Boolean functions. The property could have applications as a…
This paper presents a new framework for asynchrony. This has its origins in our attempts to better harness the internal decision making process of cellular automata (CA). Thus, we show that a max-plus algebraic model of asynchrony arises…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
In [11] and [13] the authors showed that elementary cellular automata rules 0, 3, 8, 12, 15, 28, 32, 34, 44, 51, 60, 128, 136, 140, 160, 162, 170, 200 and 204 (and their conjugation, reflection, reflected-conjugation) are not maximum…
The paper combines two topics belonging to the general theme of the spontaneous symmetry breaking (SSB) in systems including two basic competing ingredients: the self-focusing cubic nonlinearity and a double-well-potential (DWP) structure.…
We study the classification of cellular-automaton update rules into Wolfram's four classes. We start with the notion of the input entropy of a spatiotemporal block in the evolution of a cellular automaton, and build on it by introducing two…
Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept…