The Number of Orbits of Periodic Box-Ball Systems

  title={The Number of Orbits of Periodic Box-Ball Systems},
  author={Akihiro Mikoda and Shuichi Inokuchi and Yoshihiro Mizoguchi and Mitsuhiko Fujio},
A box-ball system is a kind of cellular automata obtained by the ultradiscrete Lotka-Volterra equation. Similarities and differences between behavious of discrete systems (cellular automata) and continuous systems (differential equations) are investigated using techniques of ultradiscretizations. Our motivations is to take advantage of behavious of box-ball systems for new kinds of computations. Especially, we tried to find out useful periodic box-ball systems(pBBS) for random number… 
2 Citations

Encapsulating Reaction-Diffusion Computers

This work increases applicability domain of the reaction-diffusion computers by encapsulating them in a membrane, in a form of vegetative state, plasmodium, of true slime mold, so that they can also realize Kolmogorov-Uspensky machine.

The box–ball system and the N-soliton solution of the ultradiscrete KdV equation

Any state of the box–ball system (BBS) together with its time evolution is described by the N-soliton solution (with appropriate choice of N) of the ultradiscrete KdV equation. It is shown that



LETTER TO THE EDITOR: Box and ball system with a carrier and ultradiscrete modified KdV equation

A new soliton cellular automaton is proposed. It is defined by an array of an infinite number of boxes, a finite number of balls and a carrier of balls. Moreover, it reduces to a discrete equation

Fundamental cycle of a periodic box?ball system and solvable lattice models

We investigate the fundamental cycle of a periodic box–ball system (PBBS) from a relation between the PBBS and a solvable lattice model. We show that the fundamental cycle of the PBBS is obtained

Box-Ball Systems and Robinson-Schensted-Knuth Correspondence

We study a box-ball system from the viewpoint of combinatorics of words and tableaux. Each state of the box-ball system can be transformed into a pair of tableaux (P, Q) by the

Hamiltonian path problems in the on-line optimization of flexible manufacturing systems

This thesis computationally compare several on-line heuristics and derive lower bounds on the value obtained by an optimal on--line strategy by analyzing two off--line Combinatorial Optimization problems: the asymmetric Hamiltonian path problem with precedence constraints and the asymmetry of time windows.

On the Weight of Computations

The exponential function seems to give a crude upper limit for the feasibly computable, which could give a deeper understanding of the limits of rational intellectual processes and insights into the power and limits of scientific theories.

Light speed reduction to 17 metres per second in an ultracold atomic gas

Techniques that use quantum interference effects are being actively investigated to manipulate the optical properties of quantum systems. One such example is electromagnetically induced transparency,

Some methods for classification and analysis of multivariate observations

The main purpose of this paper is to describe a process for partitioning an N-dimensional population into k sets on the basis of a sample. The process, which is called 'k-means,' appears to give

Molecular computation of solutions to combinatorial problems.

This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.

A continuous-wave Raman silicon laser

The demonstration of a continuous-wave silicon Raman laser is demonstrated and it is shown that TPA-induced FCA in silicon can be significantly reduced by introducing a reverse-biased p-i-n diode embedded in a silicon waveguide.