The authors build a non-abelian gauge-invariant cellular automaton by adding a permutation-valued gauge field to a basic shift rule, then define and characterize equivalence and invariant sets for gauge-invariant CA.
Princeton University Press (2013)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Non-Abelian Gauge-Invariant Cellular Automata
The authors build a non-abelian gauge-invariant cellular automaton by adding a permutation-valued gauge field to a basic shift rule, then define and characterize equivalence and invariant sets for gauge-invariant CA.