F-squares over cellular automata
Joanne Hall, Kerri Morgan, Stella Stylianou, Vindya Warnakulasooriyage · 2026
Read F-squares over cellular automata by Joanne Hall, Kerri Morgan, Stella Stylianou, Vindya Warnakulasooriyage (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/plos-pone-0355562.txt.
Description
Joanne Hall and colleagues ask which balanced number arrays can be grown by simple local rules called cellular automata. The arrays, named F-squares, hold each symbol equally often in every row and column, a property prized in experiment design. Their 2026 paper works over the two-symbol case and studies row and column totals.
Careful attention goes to column and row pairs whose codes differ in just one position. Two families of local rules turn out to guarantee the equal totals: rules that shuffle symbols bijectively and rules that stay constant. The punchline is restrictive. Every F-square an automaton can generate this way is either a Latin square, where each symbol appears once per line, or a trivial case.
Catalog record
| CREATOR | Joanne Hall, Kerri Morgan, Stella Stylianou, Vindya Warnakulasooriyage |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 47201 |
| LICENSE | CC_BY |
| RIGHTS | CC BY |
| SOURCE | PLOS |