Search

We present an elementary algorithm for the dynamics of recently introduced soliton cellular automata associated with quantum affine algebra U_q(g_n) at q=0. For g_n = A^{(1)}_n, the rule reproduces the ball-moving algorithm in Takahashi-Satsuma's box-ball system. For non-exceptional g_n other than A^{(1)}_n, it is described as a motion of particles and anti-particles which undergo pair-annihilation and creation through a neutral bound state. The algorithm is formulated without using representation theory nor crystal basis theory., Comment: LaTex2e 9 pages, no figure. For proceedings of SIDE IV conference

Solvable vertex models in statistical mechanics give rise to soliton cellular automata at q=0 in a ferromagnetic regime. By means of the crystal base theory we study a class of such automata associated with non-exceptional quantum affine algebras U'_q(\hat{\geh}_n). Let B_l be the crystal of the U'_q(\hat{\geh}_n)-module corresponding to the l-fold symmetric fusion of the vector representation. For any crystal of the form B = B_{l_1} \otimes ... \otimes B_{l_N}, we prove that the combinatorial R matrix B_M \otimes B \xrightarrow{\sim} B \otimes B_M is factorized into a product of Weyl group operators in a certain domain if M is sufficiently large. It implies the factorization of certain transfer matrix at q=0, hence the time evolution in the associated cellular automata. The result generalizes the ball-moving algorithm in the box-ball systems., Comment: 19pages, LaTeX2e, no figure. For proceedings of The Baxter revolution in mathematical physics. (revised version)

A soliton cellular automaton associated with crystals of symmetric tensor representations of the quantum affine algebra U'_q(A^{(1)}_M) is introduced. It is a crystal theoretic formulation of the generalized box-ball system in which capacities of boxes and carriers are arbitrary and inhomogeneous. Scattering matrices of two solitons coincide with the combinatorial R matrices of U'_q(A^{(1)}_{M-1}). A piecewise linear evolution equation of the automaton is identified with an ultradiscrete limit of the nonautonomous discrete KP equation. A class of N soliton solutions is obtained through the ultradiscretization of soliton solutions of the latter., Comment: 45 pages, latex2e, 2 figures

The combinatorial R matrices are obtained for a family {B_l} of crystals for U'_q(C^{(1)}_n) and U'_q(A^{(2)}_{2n-1}), where B_l is the crystal of the irreducible module corresponding to the one-row Young diagram of length l. The isomorphism B_l\otimes B_k \simeq B_k \otimes B_l and the energy function are described explicitly in terms of a C_n-analogue of the Robinson-Schensted-Knuth type insertion algorithm. As an application a C^{(1)}_n-analogue of the Kostka polynomials is calculated for several cases., Comment: 38 pages, latex2e, no figure

We introduce a class of cellular automata associated with crystals of irreducible finite dimensional representations of quantum affine algebras U'_q(\hat{\geh}_n). They have solitons labeled by crystals of the smaller algebra U'_q(\hat{\geh}_{n-1}). We prove stable propagation of one soliton for \hat{\geh}_n = A^{(2)}_{2n-1}, A^{(2)}_{2n}, B^{(1)}_n, C^{(1)}_n, D^{(1)}_n and D^{(2)}_{n+1}. For \gh_n = C^{(1)}_n, we also prove that the scattering matrices of two solitons coincide with the combinatorial R matrices of U'_q(C^{(1)}_{n-1})-crystals., Comment: 29 pages, 1 figure, LaTeX2e

Fermionic formulae originate in the Bethe ansatz in solvable lattice models. They are specific expressions of some q-polynomials as sums of products of q-binomial coefficients. We consider the fermionic formulae associated with general non-twisted quantum affine algebra U_q(X^{(1)}_n) and discuss several aspects related to representation theories and combinatorics. They include crystal base theory, one dimensional sums, spinon character formulae, Q-system and combinatorial completeness of the string hypothesis for arbitrary X_n., Comment: 49 pages, no figures, LaTeX2e using package amsmath