Combinatorial representation of invariants of a soliton cellular automaton

Makoto Torii, Daisuke Takahashi, Junkichi Satsuma

Research output: Contribution to journalArticle

30 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
Publication statusPublished - 1996
Externally publishedYes

Fingerprint

cellular automata
Cellular automata
Solitons
Cellular Automata
solitary waves
Young Tableaux
Invariant
Automata
Language

Keywords

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

ASJC Scopus subject areas

  • Applied Mathematics
  • Statistical and Nonlinear Physics

Cite this

Combinatorial representation of invariants of a soliton cellular automaton. / Torii, Makoto; Takahashi, Daisuke; Satsuma, Junkichi.

In: Physica D: Nonlinear Phenomena, Vol. 92, No. 3-4, 1996, p. 209-220.

Research output: Contribution to journalArticle

@article{e7ab83d4b84245b7ac2d14cd1ed14678,
title = "Combinatorial representation of invariants of a soliton cellular automaton",
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.",
keywords = "Cell automaton, Combinatorics of permutations, Dyck language, Integrable system, Robinson-Schensted algorithm",
author = "Makoto Torii and Daisuke Takahashi and Junkichi Satsuma",
year = "1996",
language = "English",
volume = "92",
pages = "209--220",
journal = "Physica D: Nonlinear Phenomena",
issn = "0167-2789",
publisher = "Elsevier",
number = "3-4",

}

TY - JOUR

T1 - Combinatorial representation of invariants of a soliton cellular automaton

AU - Torii, Makoto

AU - Takahashi, Daisuke

AU - Satsuma, Junkichi

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

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 -