6533b7cffe1ef96bd1258ff8
RESEARCH PRODUCT
Semipredictable dynamical systems
Vladimir García-moralessubject
Numerical AnalysisDynamical systems theoryCellular Automata and Lattice Gases (nlin.CG)Applied MathematicsComplex systemFOS: Physical sciencesMathematical Physics (math-ph)Nonlinear Sciences - Chaotic Dynamics01 natural sciencesCellular automaton010305 fluids & plasmasCombinatoricsNonlinear systemSuperposition principleModeling and Simulation0103 physical sciencesPrime factorChaotic Dynamics (nlin.CD)Moufang loop010306 general physicsNonlinear Sciences - Cellular Automata and Lattice GasesMathematical PhysicsMathematicsdescription
A new class of deterministic dynamical systems, termed semipredictable dynamical systems, is presented. The spatiotemporal evolution of these systems have both predictable and unpredictable traits, as found in natural complex systems. We prove a general result: The dynamics of any deterministic nonlinear cellular automaton (CA) with $p$ possible dynamical states can be decomposed at each instant of time in a superposition of $N$ layers involving $p_{0}$, $p_{1}$,... $p_{N-1}$ dynamical states each, where the $p_{k\in \mathbb{N}}$, $k \in [0, N-1]$ are divisors of $p$. If the divisors coincide with the prime factors of $p$ this decomposition is unique. Conversely, we also prove that $N$ CA working on symbols $p_{0}$, $p_{1}$,... $p_{N-1}$ can be composed to create a graded CA rule with $N$ different layers. We then show that, even when the full spatiotemporal evolution can be unpredictable, certain traits (layers) can exactly be predicted. We present explicit examples of such systems involving compositions of Wolfram's 256 elementary CA and a more complex CA rule acting on a neighborhood of two sites and 12 symbols and whose rule table corresponds to the smallest Moufang loop $M_{12}(S_{3},2)$.
year | journal | country | edition | language |
---|---|---|---|---|
2015-07-30 | Communications in Nonlinear Science and Numerical Simulation |