Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 209-220 |
| Number of pages | 12 |
| Journal | Physica D: Nonlinear Phenomena |
| Volume | 92 |
| Issue number | 3-4 |
| DOIs | |
| Publication status | Published - 1996 Jan 1 |
| Externally published | Yes |
Keywords
- Cell automaton
- Combinatorics of permutations
- Dyck language
- Integrable system
- Robinson-Schensted algorithm
ASJC Scopus subject areas
- Statistical and Nonlinear Physics
- Mathematical Physics
- Condensed Matter Physics
- Applied Mathematics
Fingerprint Dive into the research topics of 'Combinatorial representation of invariants of a soliton cellular automaton'. Together they form a unique fingerprint.
Cite this
Torii, M., Takahashi, D., & Satsuma, J. (1996). Combinatorial representation of invariants of a soliton cellular automaton. Physica D: Nonlinear Phenomena, 92(3-4), 209-220. https://doi.org/10.1016/0167-2789(95)00285-5