Creation of ballot sequences in a periodic cellular automaton

Nonlinear Sciences – Exactly Solvable and Integrable Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

31 pages. Section 1 changed and section 5 added

Scientific paper

10.1143/JPSJ.78.024003

Motivated by an attempt to develop a method for solving initial value problems in a class of one dimensional periodic cellular automata (CA) associated with crystal bases and soliton equations, we consider a generalization of a simple proposition in elementary mathematics. The original proposition says that any sequence of letters 1 and 2, having no less 1's than 2's, can be changed into a ballot sequence via cyclic shifts only. We generalize it to treat sequences of cells of common capacity s > 1, each of them containing consecutive 2's (left) and 1's (right), and show that these sequences can be changed into a ballot sequence via two manipulations, cyclic and "quasi-cyclic" shifts. The latter is a new CA rule and we find that various kink-like structures are traveling along the system like particles under the time evolution of this rule.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Creation of ballot sequences in a periodic cellular automaton does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Creation of ballot sequences in a periodic cellular automaton, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Creation of ballot sequences in a periodic cellular automaton will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-403695

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.