PreprintarXiv licencearXiv
Braids on the Stranded Cellular Automata Model
Abstract
The Stranded Cellular Automata (SCA) model is a grid of cells such that each cell can contain 0, 1, or 2 strands, together with two cellular automata that control when and how strands turn and cross. It was developed to study patterns occurring in fiber arts. We define a notion of what it means for a braid, in the sense of an element of a braid group, to be represented by an SCA pattern, and provide several algorithms to determine when a braid has an SCA representation with certain additional properties.
Related
- Gardens of Eden and amenability on cellular automata
- Random Cellular Automata and deBruijn Graphs
- When do lazy and invertible cellular automata generate all cellular automata?
- Elementary cellular automata: spectral properties of Koopman operator for finite periodic realizations
- A characterization of the reversibility of linear cellular automata
BibTeX
@misc{renner2026braids,
title = {{Braids on the Stranded Cellular Automata Model}},
author = {Alexa Renner},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.08091},
eprint = {2609.08091},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.08091},
}
RIS
TY - UNPB
TI - Braids on the Stranded Cellular Automata Model
AU - Alexa Renner
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.08091
UR - https://arxiv.org/abs/2609.08091
AB - The Stranded Cellular Automata (SCA) model is a grid of cells such that each cell can contain 0, 1, or 2 strands, together with two cellular automata that control when and how strands turn and cross. It was developed to study patterns occurring in fiber arts. We define a notion of what it means for a braid, in the sense of an element of a braid group, to be represented by an SCA pattern, and provide several algorithms to determine when a braid has an SCA representation with certain additional properties.
ER -