Shift-Symmetric Configurations in d-Dimensional Cellular Automata: Enumeration, Bounds, Irreversibility, and Detection
math.CO, math.DS
Submitted: 2026-11-11
Updated: 2026-11-11
Code: https://github.com/peterbanda/d-dim-shift-symmetry-in-ca
Terminology
Sources
- Shift-Symmetric Configurations in Two-Dimensional Cellular Automata: Irreversibility, Insolvability, and Enumeration
- Cellular Automata and Finite Groups
- Von Neumann Regular Cellular Automata
- The number of configurations in the full shift with a given least period
- Group Colorings and Bernoulli Subflows
- Combinatorial Algorithms for Multidimensional Necklaces
- Symmetries and Dynamics of Discrete Systems
- Structural and Symmetry Analysis of Discrete Dynamical Systems
- Symmetry Breaking and Equivariant Neural Networks
- Computational Studies of Quantum Spin Systems
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality