Symmetry pattern transition in cellular automata with complex behavior

Simple item page
dc.creatorSanchez, J. R.
dc.creatorLopez-Ruiz, R.
dc.date2005-12-08
dc.date.accessioned2026-07-07T06:55:56Z
dc.date.available2026-07-07T06:55:56Z
dc.descriptionA transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex symmetrical patterns by stochastically coupling a proportion $p$ of pairs of sites located at equal distance from the center of the lattice. A nontrivial critical value of $p$ must be surpassed in order to obtain symmetrical patterns during the evolution. This strategy is able to classify the cellular automata rules -with complex behavior- between those that support time-dependent symmetric patterns and those which do not support such kind of patterns.
dc.description6 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/nlin/0512017
dc.identifierhttp://arxiv.org/abs/nlin/0512017
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106449
dc.subjectCellular Automata and Lattice Gases
dc.subjectDisordered Systems and Neural Networks
dc.subjectDiscrete Mathematics
dc.subjectDynamical Systems
dc.titleSymmetry pattern transition in cellular automata with complex behavior
dc.typetext

Files

Collections

arXiv