Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.25078

Diagonal Bases and Diagonal Periods of Elementary Cellular Automata

Tigran Nersissian
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

nlin.CGcs.FL

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tigran Nersissian. 2026-09-18. Diagonal Bases and Diagonal Periods of Elementary Cellular Automata. https://doi.org/10.5281/zenodo.22747701

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

Diagonal Periods and Newton Supports of Rules 30, 86 and 135

The single-seed Rule 30 cone has unbounded least diagonal periods in both directions. On the finite-support side, first contact fixes the least Newton index and an integer polynomial lift gives a Fibonacci ceiling. For reflected Rule 86, a backward map on periodic tail profiles retains the zero boundary and bounds periods independently of transients. At depth $m$, the Rule 30 period is at least $\lfloor m/2\rfloor+1$; for natural Rule 86 cuts through depth $m$, the largest period is at least $\tfrac12\log_2(m+2)$. This proves infinitely many reset/integration period doublings. The physical Rule 135 orbit is a translated complement of Rule 30 after its first step, yielding finite or cofinite supports. A separately initialized auxiliary recurrence has exact index-by-index stabilization. Residue tables and block formulas describe the remaining structure and permit evaluation from supplied representations. Construction and minimization remain separate costs.

nlin.CG↗