Combinatorial representation of invariants of a soliton cellular automaton

Makoto Torii, Daisuke Takahashi, Junkichi Satsuma

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)

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 languageEnglish
Pages (from-to)209-220
Number of pages12
JournalPhysica D: Nonlinear Phenomena
Volume92
Issue number3-4
DOIs
Publication statusPublished - 1996
Externally publishedYes

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