Coxeter Groups and Asynchronous Cellular Automata
From MaRDI portal
Publication:4931235
DOI10.1007/978-3-642-15979-4_43zbMath1306.68110arXiv1010.1955MaRDI QIDQ4931235
Matthew Macauley, Henning S. Mortveit
Publication date: 4 October 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.1955
20F55: Reflection and Coxeter groups (group-theoretic aspects)
68Q80: Cellular automata (computational aspects)
37B15: Dynamical aspects of cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Update sequence stability in graph dynamical systems
- Dynamics groups of asynchronous cellular automata
- Posets from admissible Coxeter sequences.
- An introduction to sequential dynamical systems
- Conjugacy of Coxeter elements.
- A finiteness property and an automatic structure for Coxeter groups
- Combinatorics of Coxeter Groups
- ON ASYNCHRONOUS CELLULAR AUTOMATA
- Order Independence in Asynchronous Cellular Automata
- On enumeration of conjugacy classes of Coxeter elements
- Cycle equivalence of graph dynamical systems
- A Contribution to the Theory of Chromatic Polynomials