arXiv (All)
open access
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Graph-based automata#986471
- Computing Linear Codes and Unitals#921553
- Recursive construction of spectral basis and its application to matrices#1050596
- Solutions to Three Conjectures and an Open Problem on Binary BCH Codes#819973
- A survey of complex generalized weighing matrices and a construction of quantum error-correcting codes#1078444
Record · ID 1051571
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive