Equality of cycle lengths in one- and two-dimensional $σ$ automata
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912916621492224 |
|---|---|
| author | Vadali, Avi Turner, Ari |
| author_facet | Vadali, Avi Turner, Ari |
| contents | When the game Lights Out is played according to an algorithm specifying the player's sequence of moves, it can be modeled using deterministic cellular automata. One such model reduces to the $σ$ automaton, which evolves according to the 2-dimensional analog of Rule 90. We consider how the cycle lengths of multi-dimensional $σ$ automata depend on their dimension. We find that the cycle lengths of 1-dimensional $σ$ automata and 2-dimensional $σ$ automata (of the same size) are equal, and we prove this by relating the eigenvalues and Jordan blocks of their respective adjacency matrices. We also discover that cycle lengths of higher-dimensional $σ$ automata are bounded (despite the number of lattice sites increasing with dimension) and eventually saturate the upper bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_10898 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Equality of cycle lengths in one- and two-dimensional $σ$ automata Vadali, Avi Turner, Ari Formal Languages and Automata Theory Group Theory When the game Lights Out is played according to an algorithm specifying the player's sequence of moves, it can be modeled using deterministic cellular automata. One such model reduces to the $σ$ automaton, which evolves according to the 2-dimensional analog of Rule 90. We consider how the cycle lengths of multi-dimensional $σ$ automata depend on their dimension. We find that the cycle lengths of 1-dimensional $σ$ automata and 2-dimensional $σ$ automata (of the same size) are equal, and we prove this by relating the eigenvalues and Jordan blocks of their respective adjacency matrices. We also discover that cycle lengths of higher-dimensional $σ$ automata are bounded (despite the number of lattice sites increasing with dimension) and eventually saturate the upper bound. |
| title | Equality of cycle lengths in one- and two-dimensional $σ$ automata |
| topic | Formal Languages and Automata Theory Group Theory |
| url | https://arxiv.org/abs/2502.10898 |