Combinatorial representation of invariants of a soliton cellular automaton

Makoto Torii; Daisuke Takahashi; Junkichi Satsuma

doi:10.1016/0167-2789(95)00285-5

Combinatorial representation of invariants of a soliton cellular automaton

Makoto Torii, Daisuke Takahashi, Junkichi Satsuma

School of Fundamental Science and Engineering

Research output: Contribution to journal › Article

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 language	English
Pages (from-to)	209-220
Number of pages	12
Journal	Physica D: Nonlinear Phenomena
Volume	92
Issue number	3-4
DOIs	https://doi.org/10.1016/0167-2789(95)00285-5
Publication status	Published - 1996 Jan 1

Fingerprint

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

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

@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",

month = jan,

day = "1",

doi = "10.1016/0167-2789(95)00285-5",

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/1/1

Y1 - 1996/1/1

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 -

Access to Document

10.1016/0167-2789(95)00285-5