A uniform approach to soliton cellular automata using rigged configurations
classification
🧮 math.CO
math-phmath.MP
keywords
automatacellularsolitonconfigurationsdiagramdynkinriggedsolitons
read the original abstract
For soliton cellular automata, we give a uniform description and proofs of the solitons, the scattering rule of two solitons, and the phase shift using rigged configurations in a number of special cases. In particular, we prove these properties for the soliton cellular automata using $B^{r,1}$ when $r$ is adjacent to $0$ in the Dynkin diagram or there is a Dynkin diagram automorphism sending $r$ to $0$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.