TY - JOUR
T1 - Combinatorial representation of invariants of a soliton cellular automaton
AU - Torii, Makoto
AU - Takahashi, Daisuke
AU - Satsuma, Junkichi
N1 - Funding Information:
The authorsw ouldlike to thankD r. Claire Gilson for critical readingo f the manuscriptT.h is work is partially supportedb y Grants-in-Aidfo r Encouragemenotf Young Scientistsf rom the Ministry of Education,S cience and Culture (No. 3024).
PY - 1996
Y1 - 1996
N2 - The structure of the soliton cellular automaton is studied by means of combinatorial techniques. It is shown that the shape of the Young tableaux gives an infinite number of time invariants of the automaton. The employed combinatorial materials are the Dyck language, stack representable sequences and the Robinson-Schensted algorithm.
AB - The structure of the soliton cellular automaton is studied by means of combinatorial techniques. It is shown that the shape of the Young tableaux gives an infinite number of time invariants of the automaton. The employed combinatorial materials are the Dyck language, stack representable sequences and the Robinson-Schensted algorithm.
KW - Cell automaton
KW - Combinatorics of permutations
KW - Dyck language
KW - Integrable system
KW - Robinson-Schensted algorithm
UR - http://www.scopus.com/inward/record.url?scp=0000458987&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0000458987&partnerID=8YFLogxK
U2 - 10.1016/0167-2789(95)00285-5
DO - 10.1016/0167-2789(95)00285-5
M3 - Article
AN - SCOPUS:0000458987
VL - 92
SP - 209
EP - 220
JO - Physica D: Nonlinear Phenomena
JF - Physica D: Nonlinear Phenomena
SN - 0167-2789
IS - 3-4
ER -