Combinatorial representation of invariants of a soliton cellular automaton

DOI10.1016/0167-2789(95)00285-5zbMath0885.68112OpenAlexW2033690004MaRDI QIDQ1912488

Makoto Torii, Daisuke A. Takahashi, Junkichi Satsuma

Publication date: 7 May 1996

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-2789(95)00285-5

zbMATH Keywords

Dyck languagesoliton cellular automatonRobinson-Schemsted algorithmstack representable sequences

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Applications of dynamical systems (37N99)

Related Items

Relationships between two approaches: rigged configurations and 10-eliminations ⋮ Inverse scattering method for a soliton cellular automaton ⋮ From braces to Hecke algebras and quantum groups ⋮ Toda-type cellular automaton and its \(N\)-soliton solution ⋮ Soliton Decomposition of the Box-Ball System ⋮ Crystal interpretation of Kerov-Kirillov-Reshetikhin bijection. II: Proof for \(\mathfrak{sl}_{n}\) case ⋮ Path description of conserved quantities of generalized periodic box-ball systems ⋮ Stable difference equations associated with elementary cellular automata ⋮ Invariant measures for the box-ball system based on stationary Markov chains and periodic Gibbs measures ⋮ Box-ball systems and Robinson-Schensted-Knuth correspondence ⋮ The ghost-box-ball system: a unified perspective on soliton cellular automata, the RSK algorithm and phase shifts ⋮ Inversible Max-Plus algebras and integrable systems

Cites Work

• Soliton-like behavior in automata
• A Rule for Fast Computation and Analysis of Soliton Automata
• Evolution Theory, Periodic Particles, and Solitons in Cellular Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial representation of invariants of a soliton cellular automaton