Simple algorithm for factorized dynamics of the g_n-automaton

From MaRDI portal
Publication:2773096



Abstract: We present an elementary algorithm for the dynamics of recently introduced soliton cellular automata associated with quantum affine algebra U_q(g_n) at q=0. For g_n = A^{(1)}_n, the rule reproduces the ball-moving algorithm in Takahashi-Satsuma's box-ball system. For non-exceptional g_n other than A^{(1)}_n, it is described as a motion of particles and anti-particles which undergo pair-annihilation and creation through a neutral bound state. The algorithm is formulated without using representation theory nor crystal basis theory.


The goal of this paper is to translate the factorized dynamics stated in the crystal language into an analogue of the ball-moving algorithm, and thereby to describe the \({\mathfrak g}_n\)-automaton in terms of a simple evolution rule. The algorithm is formulated without using representation theory or crystal basis theory.











This page was built for publication: Simple algorithm for factorized dynamics of the \({\mathfrak g}_n\)-automaton

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2773096)