Generalization of the \epsilon-BBS and the Schensted insertion algorithm
From MaRDI portal
Generalization of the $\epsilon$-BBS and the Schensted insertion algorithm
Abstract: The -BBS is the family of solitonic cellular automata obtained via the ultradiscretization of the elementary Toda orbits, which is a parametrized family of integrable systems unifying the Toda equation and the relativistic Toda equation. In this paper, we derive the -BBS with many kinds of balls and give its conserved quantities by the Schensted insertion algorithm which is introduced in combinatorics. To prove this, we extend birational transformations of the continuous elementary Toda orbits to the discrete hungry elementary Toda orbits.
This page was built for publication: Generalization of the $\epsilon$-BBS and the Schensted insertion algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6391478)
