1999
DOI: 10.1016/s0375-9601(99)00162-0
|View full text |Cite
|
Sign up to set email alerts
|

Soliton cellular automaton, Toda molecule equation and sorting algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

2
37
0

Year Published

2001
2001
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 38 publications
(39 citation statements)
references
References 10 publications
2
37
0
Order By: Relevance
“…It is worth pointing out here that the time evolution of the (e i , f i ) is known to satisfy the ultradiscrete Toda molecule equation with boundary condition f 0 = f N = ∞ [14].…”
Section: The Solitons and Backgroundmentioning
confidence: 99%
See 1 more Smart Citation
“…It is worth pointing out here that the time evolution of the (e i , f i ) is known to satisfy the ultradiscrete Toda molecule equation with boundary condition f 0 = f N = ∞ [14].…”
Section: The Solitons and Backgroundmentioning
confidence: 99%
“…One of the simplest, which we shall describe here is due to Nagai et al [14,4]. Firstly, though, we shall write down our initial solution with the background removed.…”
Section: The Solitonsmentioning
confidence: 99%
“…There are two types of evolution equations for the BBS. One is derived from the discrete KdV lattice which corresponds to the Euler representation and another is from the discrete Toda lattice with finite boundary condition [3] which corresponds to the "difference form" of the Lagrange representation, we call the finite Toda representation in this paper. Note that these Euler-Lagrange notions for cellular automata come from hydrodynamics [4].…”
Section: Introductionmentioning
confidence: 99%
“…Recently, the researche areas using ultradiscritizations is extending and it contains crystal formulations, combinatorics, stochastic cellular automata and algorithms [1,2,4,5].…”
Section: Introductionmentioning
confidence: 99%