Related papers: Symmetric Nonlinear Cellular Automata as Algebraic…
In this article, we bypass the detailed symmetry breaking pathways established in [1]. Instead, a direct route from the Spin(10) model to the Standard Model is enabled via a single algebraic constraint. This single constraint, however, may…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing…
A new symplectic-based shell-model approach to clustering in atomic nuclei is proposed by considering the simple system $^{20}$Ne. Its relation to the collective excitations of this system is mentioned as well. The construction of the Pauli…
For any group $G$ and any set $A$, a cellular automaton (CA) is a transformation of the configuration space $A^G$ defined via a finite memory set and a local function. Let $\text{CA}(G;A)$ be the monoid of all CA over $A^G$. In this paper,…
We show from general principles that there must be a center of mass energy, $\sqrt s_0$, where the polarization asymmetry $A=\Delta \sigma({\gamma e \to W \nu })/ \sigma({\gamma e \to W \nu })$ for circularly-polarized photon and electron…
We show that a behaviour analogous to degenerate hyperbolicity can occur in nearest-neighbour cellular automata (CA) with three states. We construct a 3-state rule by "lifting" elementary CA rule 140. Such "lifted" rule is equivalent to…
Modeling the ability of multicellular organisms to build and maintain their bodies through local interactions between individual cells (morphogenesis) is a long-standing challenge of developmental biology. Recently, the Neural Cellular…
This paper deals with the theory and application of 2-Dimensional, nine-neighborhood, null- boundary, uniform as well as hybrid Cellular Automata (2D CA) linear rules in image processing. These rules are classified into nine groups…
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain…
A simple and yet powerful approach for modeling the structure of endohedrally confined diatomic molecules is introduced. The theory, based on a u(4)+u(3) dynamical algebra, combines u(4), the vibron model dynamical algebra, with a u(3)…
There exists algorithms to detect reversibility of cellular automaton (CA) for both finite and infinite lattices taking quadratic time. But, can we identify a $d$-state CA rule in constant time that is always reversible for every lattice…
We obtain the exact Dirac algebra obeyed by the conserved non-local charges in bosonic non-linear sigma models. Part of the computation is specialized for a symmetry group $O(N)$. As it turns out the algebra corresponds to a cubic…
Cellular automata (CA) have been found as an attractive modeling tool for various applications, such as, pattern recognition, image processing, data compression, encryption, and specially for VLSI design & test. For such applications,…
We study classical and quantum spin models derived from one-dimensional cellular automata (CA) with nonlinear update rules, focusing on rules 30, 54 and 201. We argue that the classical models, defined such that their ground states…
We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…
This paper establishes a theoretical framework connecting neural network learning with abstract algebraic structures. We first present a minimal counterexample demonstrating that standard neural networks completely fail on compositional…
An extension of the Semimicroscopic Algebraic Cluster Model (SACM) is proposed, based on the pseudo-SU(3) model. The Hamiltonian and the spectroscopic factor operator of the model are presented and a procedure of constructing the model…
We present a detailed study of a parametric Lie algebra encompassing the symmetry algebras of various models, both continuous and discrete. This algebraic structure characterizes the isotropic oscillator (with positive, purely imaginary,…
Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…