Flexible toggles and symmetric invertible asynchronous elementary cellular automata
From MaRDI portal
Publication:724839
DOI10.1016/j.disc.2018.05.018zbMath1392.05107arXiv1511.06966OpenAlexW2963508112MaRDI QIDQ724839
Publication date: 26 July 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.06966
parity functionorbit structureasynchronous cellular automatonflexible toggle groupgeneralized toggle groupsequential dynamical system
Permutations, words, matrices (05A05) Cellular automata (computational aspects) (68Q80) Graph theory (05C99) Group actions on combinatorial structures (05E18)
Cites Work
- Unnamed Item
- Iterative properties of birational rowmotion. I: Generalities and skeletal posets.
- Promotion and rowmotion
- Dynamics groups of asynchronous cellular automata
- Noncrossing partitions, toggles, and homomesies
- Iterative properties of birational rowmotion. II: Rectangles and triangles.
- Promotion and evacuation
- Elements of a theory of computer simulation. I
- Reachability problems for sequential dynamical systems with threshold functions.
- On some special classes of sequential dynamical systems
- Elements of a theory of simulation. II: Sequential dynamical systems.
- On acyclic orientations and sequential dynamical systems
- Linear sequential dynamical systems, incidence algebras, and Möbius functions
- Discrete, sequential dynamical systems
- Elements of a theory of simulation. III: Equivalence of SDS.
- Orbits of antichains revisited
- A graph-dynamical interpretation of Kiselman's semigroups
- Dynamical algebraic combinatorics and the homomesy phenomenon
- THE EXPECTED JAGGEDNESS OF ORDER IDEALS
- Cycle equivalence of graph dynamical systems
- Rowmotion and generalized toggle groups
- Piecewise-linear and birational toggling
- Linear Finite Dynamical Systems
- Sequential dynamical systems over words
This page was built for publication: Flexible toggles and symmetric invertible asynchronous elementary cellular automata
