Search arXivSearch

arXiv · 2606.08983

Dynamics in a Low-Rank Separable Field Cellular Automaton

Abstract

Cellular automata (CA), computational models used to study the emergence of life-like behaviors, classically apply local interaction and updating rules. Yet, another interacting paradigm observed in life, the globally coupled computation is usually overlooked in traditional CA. Here, we introduce a Separable-Field Cellular Automaton (SFCA), a normalized-field cellular automaton in which local-neighborhood interactions is replaced by a global coupling field. Each cell is updated according to a normalized field, with survival and birth governed by two threshold intervals. Systematic scans over interval widths and positions revealed four outcome classes: extinction, fixed points, cycles, and long transients. The outcome phase diagram was organized by the relative geometry of the survival and birth intervals: fixed points dominated when born interval was contained in survival interval, whereas long transients concentrated near the boundary between partial overlap and no overlap. A fine scan along this transition showed that the long-transient region forms a narrow but persistent ridge separating two qualitatively distinct cycle-dominated regimes. One side produced dense, high-change-rate cycles approximating global period-2 alternation, whereas the other produced sparse, low-change-rate, stripe-like cycles. Damage-spreading further supported a basin-competition interpretation, in which the long-transient ridge reflects delayed selection between two cyclic attractor families rather than random nonconvergence, while finite-size analysis shows that the long-transient ridge remains robust across tested grid sizes. These results illustrate that long-transient dynamics can arise under separable field coupling with a rank-1 field matrix, suggesting that nontrivial collective organization does not necessarily require complicated interaction rules in a globally coupled system.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaorui Shi, Mengsha Huang. 2026-08-04. Dynamics in a Low-Rank Separable Field Cellular Automaton. https://arxiv.org/abs/2606.08983

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dimension-dependent continuum limits in tissue mechanics

Continuum descriptions of epithelial tissue mechanics can replace expensive individual-based simulations with tractable macroscopic models, yet the link between cell-scale forces and tissue-scale transport remains poorly understood. We show that dimensionality controls this link: long-time mechanical relaxation rates reveal generalized porous-media-type nonlinear transport phenomena, $D(ρ)\proptoρ^γ$. Exponents in nonlinear diffusivities are fixed by microscopic mechanics and dimensionality, providing a novel physical mechanism for emergent macroscopic transport phenomena.

nlin.CG

Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre

The hat and spectre monotiles, discovered in 2023, tile the plane only aperiodically; no cellular automaton dynamics on these tilings has previously been reported. Cellular automata are studied here on patches generated by finite-state transducers, so that every experiment regenerates deterministically from a small record. Within edge-adjacency semi-totalistic rules, exhaustive and evolutionary searches find only mortal travelers: gliders are absent. Guided by a reproduction of the known Penrose-tiling glider, the rule space is extended to vertex neighborhoods and to priority-table rules whose non-quiescent states are visible to neighbors. Evolutionary search then discovers gliders on both monotilings; tracked by a sliding window that regenerates the patch along the flight, they travel one million rings at constant speed and heading. All headings are quantized, to millidegrees, onto a six-spoke compass - the fast axes of the tiling's graph metric. An ablation shows both rule-space extensions are individually necessary. All results replay exactly in an accompanying interactive essay.

nlin.CG

Diagonal Bases and Diagonal Periods of Elementary Cellular Automata

Which cellular-automaton diagonal families form bases in every finite window? For canonical polynomial lifts of elementary rules, two truth-table bits determine triangularity, and units on the matrix diagonal determine invertibility. Exactly 24 rules give universal binary bases; all remain universal over every modulus. Among triangular binary coordinate maps, the Pascal transform is uniquely characterized by converting OR convolution into pointwise multiplication, while increment becomes strict prefix summation. Explicit inverses and coordinate comparisons distinguish sparsity from evaluation cost. A Rule 30 polynomial construction gives Fibonacci bounds on interpolation order and prime-modulus periods. Exact additive periods anchor a finite census modulo two and three. These results separate all-window basis classification from optimization of a representation and from period patterns observed in finite windows.

nlin.CG