Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 10 min ago
PreprintCC BY 4.0arXiv

Diagonal Bases and Diagonal Periods of Elementary Cellular Automata

  • Tigran Nersissian
Open at sourcePDFDOICite

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.

Versions

Related

  1. On the gauge invariant boundary condition in open XXZ chains: SoV bases, elementary blocks and overlaps
    G Niccoli, Véronique Terras
    HALPreprintLicence not statedMathematical physicsHigh-energy & particle physicsHAL
  2. Diagonal Periods and Newton Supports of Rules 30, 86 and 135
    Tigran Nersissian
    arXivPreprintCC BY 4.0Full textStatistical & nonlinear physicsarXiv
  3. Random Cellular Automata and deBruijn Graphs
    Janko Gravner, Travis Kulhanek
    arXivPreprintarXiv licenceFull textProbabilityStatistical & nonlinear physicsarXiv
  4. When do lazy and invertible cellular automata generate all cellular automata?
    Edgar Alcalá-Arroyo, Alonso Castillo-Ramirez
    arXivPreprintarXiv licenceFull textAlgebra & number theoryDynamical systemsarXiv
  5. Thermalization with Gaussian Quantum Cellular Automata
    Roman Geiko, Jake Gerenraich
    arXivPreprintCC BY 4.0Full textMathematical physicsQuantum physics & quantum informationarXiv

Cite

BibTeXRIS
BibTeX
@misc{nersissian2026diagonal,
  title = {{Diagonal Bases and Diagonal Periods of Elementary Cellular Automata}},
  author = {Tigran Nersissian},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.25078},
  eprint = {2609.25078},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.25078},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Diagonal Bases and Diagonal Periods of Elementary Cellular Automata
AU  - Tigran Nersissian
PY  - 2026
DA  - 2026/09/18
PB  - arXiv
DO  - 10.48550/arxiv.2609.25078
UR  - https://arxiv.org/abs/2609.25078
AB  - 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.
ER  -