Combinatorial representation of invariants of a soliton cellular automaton

Physica D: Nonlinear Phenomena

Volumn 92, Issue 3-4, 1996, Pages 209-220

  Torii, Makoto ^a   Takahashi, Daisuke ^b   Satsuma, Junkichi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b RYUKOKU UNIVERSITY   (Japan)

Author keywords

Cell automaton; Combinatorics of permutations; Dyck language; Integrable system; Robinson Schensted algorithm

Indexed keywords

EID: 0000458987     PISSN: 01672789     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-2789(95)00285-5     Document Type: Article

References (8)

1. S. Wolfram ed., Theory and Applications of Cellular Automata (World Scientific, Singapore, 1986).
2. P.K. Park, K. Steiglitz and W.P. Thurston, Physica D 19 (1986) 423.
3. T.S. Papatheodorou, M.J. Ablowitz and Y.G. Saridakis, Stud. Appl. Math. 79 (1988) 173.
4. T.S. Papatheodorou and A.S. Fokas, Stud. Appl. Math. 80 (1989) 165.
5. D. Takahashi and J. Satsuma, J. Phys. Soc. Jpn. 59 (1990) 3514.
6. D.E. Knuth, The Art of Computer Programming, Vol. 3 (Addison-Wesley, New York, 1973).
7. B.E. Sagan, The Symmetric Group (Wadsworth & Brooks/Cole, California, 1991).
8. J.E. Hopcroft and J.D. Ullman, Formal Languages and their Relation to Automata (Addison-Wesley, New York, 1969).