A uniform approach to soliton cellular automata using rigged configurations
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 Br,1 when r is adjacent to 0 in the Dynkin diagram or there is a Dynkin diagram automorphism sending r to 0.
0