Solutions of Discretized Affine Toda Field Equations for A (1)

Similar documents
Periodicities of T-systems and Y-systems

The Fundamental Basis Theorem of Geometry from an algebraic point of view

Chapter 6 1-D Continuous Groups

Reed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

Stochastic vertex models and symmetric functions

Baxter Q-operators and tau-function for quantum integrable spin chains

arxiv: v2 [math.qa] 24 Jul 2014

Feature Extraction Techniques

A1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3

Introduction to Robotics (CS223A) (Winter 2006/2007) Homework #5 solutions

Physics 139B Solutions to Homework Set 3 Fall 2009

Physics 215 Winter The Density Matrix

Mechanics Physics 151

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

On Nonlinear Controllability of Homogeneous Systems Linear in Control

Block designs and statistics

Completeness of Bethe s states for generalized XXZ model, II.

A note on the multiplication of sparse matrices

Slanted coupling of one-dimensional arrays of small tunnel junctions

Lecture 9 November 23, 2015

The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

12 Towards hydrodynamic equations J Nonlinear Dynamics II: Continuum Systems Lecture 12 Spring 2015

Order Recursion Introduction Order versus Time Updates Matrix Inversion by Partitioning Lemma Levinson Algorithm Interpretations Examples

THE POLYNOMIAL REPRESENTATION OF THE TYPE A n 1 RATIONAL CHEREDNIK ALGEBRA IN CHARACTERISTIC p n

ON REGULARITY, TRANSITIVITY, AND ERGODIC PRINCIPLE FOR QUADRATIC STOCHASTIC VOLTERRA OPERATORS MANSOOR SABUROV

Simple procedures for finding mean first passage times in Markov chains

G G G G G. Spec k G. G Spec k G G. G G m G. G Spec k. Spec k

Entangling characterization of (SWAP) 1/m and Controlled unitary gates

Hybrid System Identification: An SDP Approach

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

On the summations involving Wigner rotation matrix elements

List Scheduling and LPT Oliver Braun (09/05/2017)

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

UCSD Spring School lecture notes: Continuous-time quantum computing

v (x) = V(x+nL) ; a=- g Pair correlation function of a one-dimensional Fermi gas with strong interactions

Supporting Information for Supression of Auger Processes in Confined Structures

arxiv: v2 [math.co] 8 Mar 2018

#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE

Poly-Bernoulli Numbers and Eulerian Numbers

A note on the realignment criterion

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

Solutions of some selected problems of Homework 4

Lecture 2: Ruelle Zeta and Prime Number Theorem for Graphs

A new type of lower bound for the largest eigenvalue of a symmetric matrix

Multi-Dimensional Hegselmann-Krause Dynamics

Polygonal Designs: Existence and Construction

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels

+ -d-t-' )=1. = vpi. Aportaciones Matematicas Comunicaciones 17 (1996) 5-10.

The Indefinite Admittance Matrix

An Exactly Soluble Multiatom-Multiphoton Coupling Model

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links

On the approximation of Feynman-Kac path integrals

Jordan Journal of Physics

Harmonic Standing-Wave Excitations of Simply-Supported Isotropic Solid Elastic Circular Cylinders: Exact 3D Linear Elastodynamic Response.

Notas de Física. CBPF-NF-003/13 July Chiral and Real N = 2 supersymmetric l-conformal Galilei algebras ISSN

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Curious Bounds for Floor Function Sums

Anisotropic reference media and the possible linearized approximations for phase velocities of qs waves in weakly anisotropic media

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

}, (n 0) be a finite irreducible, discrete time MC. Let S = {1, 2,, m} be its state space. Let P = [p ij. ] be the transition matrix of the MC.

Lecture 21. Interior Point Methods Setup and Algorithm

Hee = ~ dxdy\jj+ (x) 'IJ+ (y) u (x- y) \jj (y) \jj (x), V, = ~ dx 'IJ+ (x) \jj (x) V (x), Hii = Z 2 ~ dx dy cp+ (x) cp+ (y) u (x- y) cp (y) cp (x),

A method to determine relative stroke detection efficiencies from multiplicity distributions

arxiv:q-alg/ v1 14 Feb 1997

NORMAL MATRIX POLYNOMIALS WITH NONSINGULAR LEADING COEFFICIENTS

Lean Walsh Transform

APPENDIX A THE ESSENTIALS OF MATRIX ANALYSIS

Algebraic Montgomery-Yang problem: the log del Pezzo surface case

CSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13

Statistics and Probability Letters

arxiv: v2 [hep-th] 16 Mar 2017

Principles of Optimal Control Spring 2008

Work, Energy and Momentum

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng

III.H Zeroth Order Hydrodynamics

Constrained Consensus and Optimization in Multi-Agent Networks arxiv: v2 [math.oc] 17 Dec 2008

Linear Transformations

The isomorphism problem of Hausdorff measures and Hölder restrictions of functions

Modeling Chemical Reactions with Single Reactant Specie

In this chapter, we consider several graph-theoretic and probabilistic models

An Attack Bound for Small Multiplicative Inverse of ϕ(n) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques

A Simple Regression Problem

Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms

Conchoid surfaces of spheres

δ 12. We find a highly accurate analytic description of the functions δ 11 ( δ 0, n)

Counting partitions inside a rectangle

Explicit Analytic Solution for an. Axisymmetric Stagnation Flow and. Heat Transfer on a Moving Plate

Classical and quantum aspects of ultradiscrete solitons. Atsuo Kuniba (Univ. Tokyo) 2 April 2009, Glasgow

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

Generalized binomial expansion on Lorentz cones

A BLOCK MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR A NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEM

A NOTE ON HILBERT SCHEMES OF NODAL CURVES. Ziv Ran

Four-vector, Dirac spinor representation and Lorentz Transformations

Order Ideals in Weak Subposets of Young s Lattice and Associated Unimodality Conjectures

A Markov Framework for the Simple Genetic Algorithm

On Lotka-Volterra Evolution Law

Transcription:

arxiv:solv-int/9610011v2 9 Dec 1997 Solutions of Discretized Affine Toda Field Equations for A (1) n, B n (1), C n (1), D n (1), A (2) n and D (2) n+1 Zengo Tsuboi Institute of Physics, University of Tokyo Koaba 3-8-1, Meguro-ku, Tokyo 153 Noveber 12, 2018 Abstract It is known that a faily of transfer atrix functional equations, the T-syste, can be copactly written in ters of the Cartan atrix of a siple Lie algebra. We forally replace this Cartan atrix of a siple Lie algebra with that of an affine Lie algebra, and then we obtain a syste of functional equations different fro the T-syste. Itay beviewed as an X n (a) type affine Toda field equation on discrete space tie. We present, for A (1) n, B n (1), C n (1), D n (1), A (2) n and D (2) n+1, its solutions in ters of deterinants or Pfaffians. KEYWORDS: affine Lie algebra, discretized affine Toda field equation, T- syste, deterinant, pfaffian solv-int / 9610011 Journal-ref: J. Phys. Soc. Jpn. 66 (1997) 3391-3398 1

1 Introduction Kuniba et al. proposed [1], a class of functional equations, the T-syste. It is a faily of functional equations satisfied by a set of couting transfer atrices {T (a) (u)} of solvable lattice odels associated with any quantu affine algebras U q (X r (1) ). Here, the transfer atrix T (a) (u) is defined as a trace of onodroy atrix on auxiliary space labeled by a and ( Z,u C,a {1,2,...,r}). It was pointed out [3] that the T-syste is not only a faily of transfer atrix functional equations but also an exaple of Toda field equation [4, 5] on discrete space tie. Solving the T-syste recursively, we obtained solutions {T (a) (u)} [6, 3, 7] with the following properties: 1. They are polynoials of the initial values T (1) 1 (u+shift),...,t (r) 1 (u+ shift). 2. They have deterinant or pfaffian expressions. Using the Cartan atrix of a siple Lie algebra X r, the T-syste is written as a copact for [2]. In this sense, the T-syste is considered to be a class of functional equations associated with Dynkin diagras. Then the following natural question arise. If we forally replace this Cartan atrix of a siple Lie algebra with that of a Kac-Moody Lie algebra, then we obtain a syste of functional equations different fro the T-syste. Can one construct solutions of these equations, which have siilar properties as those of the T-syste? The purpose of this paper is to answer this question. So far, we have succeeded to construct solutions for affinelie algebras A (1) n, B(1) n, C(1) n, D(1) n, A(2) n and D n+1, (2) odifying the expressions of solutions [3, 6, 7] of the T-syste. The functional equations which we deal with in this paper can be copactly written as follows: Here, (u+ 1 t a ) (u 1 t a ) = +1(u) 1(u) + r T(a,b,,u) I ab (1.1) b=0 T (a,b,,u) = T tb /t a (u) for t b t a = 1,2,3, (1.2) 2

= T (b) (u+ 1 2 2 )T(b) (u 1 2 2 )T(b) = T (b) 3 T (b) 1 3 for (u+ 2 3 )T(b) 3 (u 1 3 )T(b) t b t a = 1 3. +1 2 (u)t (b) (u)t (b) (u 2 3 )T(b) 1 3 3 (u+ 1 3 )T(b) 2 3 1 2 +2 3 (u)t (b) (u) for t b t a = 1 2, (1.3) (u) (1.4) +1 3 (u 1 3 )T(b) +1 3 (u+ 1 3 ) where a {0,1,2,...,r}; 0 (u) = 1; T (a) (u) = 1 ( if / Z ); I ab = 2δ ab B ab (I ab = 1, if athnodeof Dynkindiagraisconnected with bthnode of it; I ab = 0, if a th node of Dynkin diagra is disconnected with b th node t of it); B ab = C b ab t ab ; C ab = 2(αa α b) (α a α a) (C ab : Cartan atrix of affine Lie algebra; 2 α a : siple root); t a = ;t (α a α a) ab = ax(t a,t b ). This functional equation resebles the T-syste except the 0 th coponent T (0) (u). However, unlike the T-syste, the solutions of this functional equation (1.1) have nothing to do with the solvable lattice odels to the author knowledge. Moreover, as is entioned in section2, our functional equation ay be viewed as an exaple of discretized affine Toda field equation. In this sense, the functional equation (1.1) should be viewed as the generalization of a discretized Toda equation rather than that of the T-syste. It has beautiful structure as an exaple of discretized soliton equation [8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22]. Discrete equations have richer contents than their continuu counterparts. In fact, our new solutions here are not so-called soliton solutions which have continuu counterparts but the ones whose atrix sizes depend on the paraeter and thus peculiar to difference equations. Solving the functional equation (1.1) recursively, we can express (u) as a polynoial of T (0) 1 (u+shift),...t (r) 1 (u + shift). Cobining the siilar expressions of the solutions [6, 3, 7] to the T-syste, we present, for A (1) n, B(1) n, C(1) n, D(1) n, A(2) n and D n+1, (2) solutions of eq.(1.1) in ters of deterinants or pfaffians. For siple Lie algebras B r and D r, there are at least two types of expressions of the solutions to the T-syste, which are equivalent. The one is expressedexplicitlybypolynoialofthefundaentalpolynoialst (1) 1,...,T (r) 1 and is given as a deterinant or a pfaffian whose non-zero atrix eleents distribute sparsely [6]. The other is expressed by polynoial of auxiliary transfer atrix T a (u) (or dress function in the analytic Bethe ansatz), and 3

thus iplicitly by polynoial of the fundaental polynoials T (1) 1,...,T (r) 1 and is given as a deterinant or a pfaffian whose non-zero atrix eleents distribute densely [3, 7]. On constructing the solution of the functional equation (1.1), we use only the dense type expression of the solution to the T- syste. The boundary condition to the function T a (u) for eq.(1.1) is quite different fro that for the T-syste. As a result, in spite of the reseblance on appearance between the expression of solution to the functional equation (1.1) and that to the T-syste, the solution of the functional equation (1.1) is quite different fro that of the T-syste. As is often the case in soliton theory, ost of the proofs of the deterinant or pfaffian forulae reduce to the Jacobi identity. Theoutlineofthispaperisgivenasfollows. Insection2, wepresentexplicitly our functional equations for A (1) n, B n (1), C n (1), D n (1), A (2) n and D n+1, (2) whose solutions are given in section4. In section3, we fix the notation. Section5 is dedicated for suary and discussion. AppendixA is a list of functional equations for G (1) 2, F (1) 4, E (1) 6, E (1) 7, E (1) 8, E (2) 6 and D (3) 4, which have been not yet solved. Finally, it should be noted that, for the twisted quantu affine algebras U q (X n (k)) (X(k) n = A (2) n,d(2) n,e(2) 6,D (3) 4 ), extensions of the T-syste different fro our functional equations were proposed by Kuniba and Suzuki [23]. However, they do not reduce to affine Toda field equations in the continuu liit. 2 Functional Equations For the function T (a) (u) ( Z,u C,a {0,1,...,r}), we assue the following boundary condition: T (a) (u) = 0 for < 0, T(a) 0 (u) = 1. Substituting each Cartan atrix of affine Lie algebra into the functional equation (1.1), we obtain explicitly the following functional equations: For A (1) r (r 1), (u 1) (u+1) = +1(u) 1(u)+T (a 1) (u)t (a+1) (u) 0 a r (2.1) 4

with T ( 1) (u) = T(r) (u) and T(r+1) (u) = T (0)(u). For B (1) r (r 3), T (a) (u 1)T (a) (u+1) = T +1(u) 1(u)+ (2) (u) a = 0,1, (2.2) T (2) (u+1) = T(2) +1(u)T 1(u)+T (2) (0) (u)t(3) (u), (2.3) T (a) (u+1) = T(a) +1(u)T 1(u)+ (a 1) (u)t (a+1) (u), 3 a r 2, (2.4) T (r 1) (u 1)T (r 1) (u+1) = T (r 1) +1 (u)t (r 1) 1 (u)+t (r 2) T (r) 2(u 1/2)T (r) 2(u+1/2) = T (r) 2+1(u)T (r) 2 1(u) +T (r 1) T (r) 2+1(u 1/2)T (r) 2+1(u+1/2) = T (r) 2+2(u)T (r) 2(u) (u)t (r) 2(u), (2.5) (u 1/2)T (r 1) (u+1/2), (2.6) +T (r 1) (u)t (r 1) +1 (u). (2.7) If r = 3, eqs. (2.3) - (2.5) reduce to the following equation : T (2) (u 1)T(2) (u+1) = T(2) +1(u)T 1(u)+T (2) (0) (u)t(1) (u)t(3) 2(u). (2.8) For C (1) r (r 2), T (0) (u 1)T(0) (u+1) = T(0) +1(u)T 1(u)+T (0) 2(u), (1) (2.9) T 2(u 1/2)T (1) 2(u+1/2) (1) = T 2+1(u)T (1) 2 1(u) (1) +T (0) (u 1/2)T (0) (u+1/2)t 2(u), (2) (2.10) T 2+1(u 1/2)T (1) 2+1(u+1/2) (1) = T 2+2(u)T (1) 2(u) (1) +T (0) (u)t(0) +1(u)T 2+1(u), (2) (2.11) T (a) (u 1/2)T (a) (u+1/2) = T +1(u) 1(u)+ (a 1) (u)t (a+1) (u) 2 a r 2, (2.12) T (r 1) 2 (u 1/2)T (r 1) 2 (u+1/2) = T 2+1(u)T (r 1) 2 1(u) (r 1) +T (r 2) 2 (u)t (r) (u 1/2)T (r) (u+1/2), (2.13) T 2+1(u 1/2)T (r 1) 2+1(u+1/2) (r 1) = T 2+2(u)T (r 1) (r 1) 2 (u) +T 2+1(u)T (r 2) (r) (u)t(r) +1(u), (2.14) T (r) (u 1)T (r) (u+1) = T +1(u)T (r) 1(u)+T (r) (r 1) 2 (u). (2.15) 5

If r = 2, eqs. (2.10) - (2.14) reduce to the following equations : T 2(u 1/2)T (1) 2(u+1/2) (1) = T 2+1(u)T (1) 2 1(u) (1) +T (0) (u 1/2)T(0) (u+1/2)t(2) (u 1/2)T(2) (u+1/2), (2.16) T 2+1(u 1/2)T (1) 2+1(u+1/2) (1) = T 2+2(u)T (1) 2(u) (1) +T (0) (u)t (0) +1(u)T (2) (u)t (2) +1(u). (2.17) For D (1) r (r 4), T (a) (u 1)T(a) (u+1) = T(a) +1(u)T 1(u)+ (2) (u) a = 0,1, (2.18) T (2) (u 1)T (2) (u+1) = T +1(u)T (2) 1(u)+T (2) (0) (u)t (1) (u)t (3) (u), (2.19) (u 1)T(a) (u+1) = T(a) +1(u) 3 a r 3, T (r 2) 1(u)+T (a 1) (u 1)T (r 2) (u+1) = T (r 2) +1 (u)t (r 2) +T (r 3) 1 (u) (u)t (r 1) (u)t (a+1) (u) (2.20) (u)t (r) (u), (2.21) (u 1)T(a) (u+1) = T(a) +1(u)T 1(u)+ (r 2) (u) a = r 1,r. (2.22) If r = 4, eqs. (2.19) - (2.21) reduce to the following equation : T (2) (u 1)T(2) (u+1) = T(2) +1(u)T 1(u)+T (2) (0) (u)t(1) For A (2) 2r (r 2), (u)t(r 1) (u)t (r) (u). (2.23) T (0) (u+1) = T(0) +1(u)T 1(u)+T (0) 2(u), (1) (2.24) T 2(u 1/2)T (1) 2(u+1/2) (1) = T 2+1(u)T (1) 2 1(u)+T (1) (0) (u 1/2)T (0) (u+1/2)t 2(u), (2) (2.25) T 2+1(u 1/2)T (1) 2+1(u+1/2) (1) = T 2+2(u)T (1) 2(u) (1) +T (0) +1(u)T 2+1(u), (2) (2.26) T (a) (u 1/2)T (a) (u+1/2) = T +1(u) 1(u) (a) (2.27) T (r 1) +T (a 1) (u 1/2)T (r 1) (u+1/2) = T (r 1) (u)t (a+1) (u) 2 a r 2, +1 (u)t (r 1) 1 (u) 6

+T (r 2) (u)t 2(u), (r) (2.28) T 2(u 1/4)T (r) 2(u+1/4) (r) = T 2+1(u)T (r) 2 1(u) (r) +T (r 1) T (r) 2+1(u 1/4)T (r) 2+1(u+1/4) = T (r) 2+2(u)T (r) 2(u) (u 1/4)T (r 1) (u+1/4), (2.29) +T (r 1) (u)t (r 1) +1 (u). (2.30) If r = 2, eqs. (2.25) - (2.28) reduce to the following equations : T (1) 2(u 1/2)T 2(u+1/2) (1) = T 2+1(u)T (1) 2 1(u)+T (1) (0) (u 1/2)T (0) (u+1/2)t 4(u), (2) (2.31) T 2+1(u 1/2)T (1) 2+1(u+1/2) (1) = T 2+2(u)T (1) 2(u) (1) +T (0) (u)t (0) +1(u)T (2) 4+2(u). (2.32) For A (2) 2r 1(r 3), T (a) (u 1/2)T(a) (u+1/2) = T(a) +1(u)T 1(u)+ (2) (u) a = 0,1, (2.33) T (2) (u 1/2)T (2) (u+1/2) = T +1(u)T (2) 1(u) (2) +T (0) (u)t(1) (u)t(3) (u), (2.34) T (a) (u 1/2)T (a) (u+1/2) = T +1(u) 1(u) (a) (2.35) (u) 3 a r 2 T (r 1) 2 (u 1/2)T (r 1) 2 (u+1/2) 2 1(u)+T (r 2) 2 = T (r 1) 2+1(u)T (r 1) +T (a 1) (u)t (a+1) (u)t (r) (u 1/2)T (r) (u+1/2), (2.36) T 2+1(u 1/2)T (r 1) 2+1(u+1/2) (r 1) = T 2+2(u)T (r 1) 2 (u) +T 2+1(u)T (r 2) (r) +1(u), (2.37) T (r) (u 1)T (r) (u+1) = T +1(u)T (r) 1(u)+T (r) 2 (u). (2.38) If r = 3, eqs. (2.34) - (2.37) reduce to the following equations : T 2(u 1/2)T (2) 2(u+1/2) (2) = T 2+1(u)T (2) 2 1(u)+T (2) 2(u)T (0) 2(u)T (1) (3) (u 1/2)T(3) (u+1/2), (2.39) T 2+1(u 1/2)T (2) 2+1(u (2) + 1/2) = T 2+2(u)T (2) 2(u)+T (2) 2+1(u)T (0) 2+1(u)T (1) (3) (u)t +1(u). (3) (2.40) 7

For D (2) r+1(r 2), T 2(u 1/2)T (0) 2(u+1/2) (0) = T 2+1(u)T (0) 2 1(u) (0) +T (1) (u 1/2)T (1) (u+1/2), (2.41) T 2+1(u 1/2)T (0) 2+1(u+1/2) (0) = T 2+2(u)T (0) 2(u) (0) +T (1) (u)t(1) +1(u), (2.42) T (1) (u 1)T (1) (u+1) = T +1(u)T (1) 1(u)+T (1) 2(u)T (0) (2) (u), (2.43) (u 1)T(a) (u+1) = T(a) +1(u) T (r 1) 1(u)+T (a 1) 2 a r 2, (u 1)T (r 1) (u+1) = T (r 1) +1 (u)t (r 1) 1 (u) (u)t (a+1) (u) (2.44) +T (r 2) (u)t 2(u), (r) (2.45) T 2(u 1/2)T (r) 2(u+1/2) (r) = T 2+1(u)T (r) 2 1(u)+T (r) (r 1) (u 1/2)T (r 1) (u+1/2), (2.46) T 2+1(u 1/2)T (r) 2+1(u+1/2) (r) = T 2+2(u)T (r) 2(u) (r) +T (r 1) (u)t (r 1) +1 (u). (2.47) If r = 2, eqs. (2.43) - (2.45) reduce to the following equation : T (1) (u 1)T(1) (u+1) = T(1) +1(u)T 1(u)+T (1) 2(u)T (0) 2(u). (2) (2.48) These functional equations are neatly connected with Dynkin diagras, and thus they are reflecting Dynkin diagra syetries. For exaple, the functional equations (2.18) and (2.19) are transfored into eqs.(2.22) and (2.21) respectively under the following transforation: T (b) (u) T(r b) (u). (2.49) It was pointed out [6] that the eq.(2.1) with boundary condition T ( 1) (u) = 0, T(0) (u) = T(r+1) (u) = 1 corresponds to Hirota-Miwa equation. Kuniba et al. [3] pointed out that the T-syste ay be looked upon as a discritized Toda field equation. By the sae arguent, our functional 8

equation (1.1) ay be viewed as a discritized affine Toda field equation. Set u = v/δ and = w/δ, for functional equation (1.1). For sall δ, fro the coefficient of δ 2 on Taylor expansion, we obtain two-diensional affine Toda field equation of the for r ( v 2 2 w )logψ a(v,w) = constant ψ b (v,w) C ab (2.50) b=0 where ψ a (v,w) denotes a scaled (u) and C ab = 2(α a α b )/(α a α a ) the Cartan atrix of affine Lie algebra. 3 Notation and Convention In this section, we present a lot of expressions, which are necessary to construct the solutions. The origin of the go back to earlier work [3, 6, 7] on solutions of the T-syste. Set x [1] j (k u) = T (δ j 1) 1 (u+(2j 2)/k), y [1] j (k u) = T (δ j) 1 (u+(2j 2)/k), t [1] ij (k u) = T 1 i+j (u+(i+j 2)/k), x [2] j (k u) = T (r δ j 1) 1 (u+(2j 2)/k), y [2] j (k u) = T (r δ j) 1 (u+(2j 2)/k), t [2] ij (k u) = T r+i j 1 (u+(i+j 2)/k), (3.1) a [p] ij (k u) = x [p] i (k u)y [p] j (k u) t [p] ij (k u), b [p] ij (k u) = y [p] i (k u)x [p] j (k u) t [p] ij (k u), p = 1,2. where By the definition we have δ i = { 0 if i 2Z 1 if i 2Z+1. x [p] i (k u+2/k) = y i+1(k u), [p] y [p] i (k u+2/k) = x [p] i+1(k u), t [p] ij (k u+2/k) = t [p] i+1 j+1(k u), a [p] ij (k u+2/k) = b [p] i+1 j+1(k u), b [p] ij (k u+2/k) = a [p] i+1 j+1(k u), (3.2) for p = 1,2. These relations are necessary to prove Lea4.9. Now we introduce atrices T a a (k u) = (Tij (k u)) 1 i,j (a Z), (2) 9

(2) atrices F 2(k u) [p] = (F [p] ij (k u)) 1 i,j 2, ( + 1) ( + 1) atrices H +1(k u) [p] = (H [p] ij (k u)) 1 i,j +1, S +1(k u) [p] = (S [p] ij (k u)) 1 i,j +1, C +1(k u) [p] = (C [p] ij (k u)) 1 i,j +1 and R [p] +1(k u) = (R [p] ij (k u)) 1 i,j +1 (p = 1,2) whose (i,j) eleents are given by F [1] ij (k u) = F [2] ij (k u) = T a ij(k u) = T a+i j (u+(i+j 1)/k), (3.3) 0 : i = j T i+j 1 (u+(i+j 2 1)/k) : 1 i < j 2 T i j 1 (u+(i+j 2 1)/k) : 1 j < i 2, (3.4) 0 : i = j T i j+r+1 (u+(i+j 2 1)/k) (3.5) : 1 i < j 2 T i+j+r+1 (u+(i+j 2 1)/k) : 1 j < i 2, H [1] ij (k u) = H [2] ij (k u) = T (0) 1 (u+(2i 2)/k) :1 i +1,and,j = 1 T i+j (u+(i+j 5/2)/k) : 1 i +1, 2 j +1, T (r) 1 (u+(2i 2)/k) :1 i +1andj = 1 T r+i j (u+(i+j 5/2)/k) :1 i +1, 2 j +1, (3.6) (3.7) S [1] ij (k u) = 0 :i = j = 1 T (δ j) T (δ i) 1 (u+(2j 4)/k) :i = 1and2 j +1 1 (u+(2i 4)/k) :2 i +1andj = 1 T 1 i+j (u+(i+j 4)/k) :2 i,j +1, (3.8) S [2] ij (k u) = 0 :i = j = 1 T (r δ j) 1 (u+(2j 4)/k) :i = 1and2 j +1 T (r δ (3.9) i) 1 (u+(2i 4)/k) :2 i +1andj = 1 T r+i j 1 (u+(i+j 4)/k) :2 i,j +1, 10

C [p] ij (k u) = R [p] ij (k u) = 0 : i = j x [p] j 1(k u) : i = 1 and 2 j +1 x [p] i 1(k u) : 2 i +1 and j = 1 a [p] i 1 j 1(k u) : 2 i < j +1 a [p] j 1 i 1(k u) : 2 j < i +1, 0 : i = j x [p] j 1(k u) : i = 1 and 2 j +1 x [p] i 1(k u) : 2 i +1 and j = 1 b [p] i 1 j 1(k u) : 2 i < j +1 b [p] j 1 i 1(k u) : 2 j < i +1. (3.10) (3.11) Note that the atrices F [1] ij (k u), H [1] ij (k u), S [1] ij (k u), C [1] ij (k u) and R [1] ij (k u) are transfored into F [2] ij (k u), H [2] ij (k u), S [2] ij (k u), C [2] ij (k u) and R [2] ij (k u) respectively under the following transforation: T (b) 1 (u) T (r b) 1 (u), T b (u) T r b (u). (3.12) [ ] i1... i For any atrix M(u), we shall let M k (u) denote the inor j 1... j k atrix getting rid of i l s rows and j l s coluns fro M(u). We introduce the following pfaffian and deterinant expressions, which will be used as the coponents of the solutions. T a (k u) = det[t a (k u)] for Z 0, (3.13) F (0) (k u) = pf[f 2(k u)] [1] for Z 0, (3.14) F (r) (k u) = pf[f 2(k u)] [2] for Z 0, (3.15) G (0) (k u) = G (1) (k u) = pf[c [1] +1 [ 1 1 ] (k u+( +1)/k)] for 2Z 0 pf[c +1(k u+( +1)/k)] [1] for 2Z 0 +1, [ ] pf[c [1] 1 2 +2 (k u+( 1)/k)] for 2Z 1 2 0 ] pf[c [1] +2 [ 2 2 (3.16) (3.17) (k u+( 1)/k)] for 2Z 0 +1, 11

G (r) (k u) = G (r 1) (k u) = [ pf[c [2] 1 +1 1 pf[c [2] pf[c [2] +2 pf[c [2] +2 ] (k u+( +1)/k)] for 2Z 0 (3.18) +1(k u+( +1)/k)] for 2Z 0 +1, [ ] 1 2 (k u+( 1)/k)] for 2Z 1 2 0 [ ] 2 (k u+( 1)/k)] for 2Z 2 0 +1, (3.19) H +1(k u) (0) = det[h +1(k u /k)] [1] for Z 0, (3.20) H +1(k u) (r) = det[h +1(k u /k)] [2] for Z 0. (3.21) For a Z, k Z {0} and u C, we introduce the following functional relations, cobinations of which will be used in solving the eq.(1.1). T a (u)+t 1 a (u) = T (0) 1 (u+(a 1/2)/k)T (0) 1 (u+( a+1/2)/k), (3.22) T a (u)+t 2r 1 a (u) = T (r) 1 (u+( r +a+1/2)/k)t (r) 1 (u+(r a 1/2)/k), (3.23) T a (u)+t 2 a (u) = 0, (3.24) T a (u)+t 2r a+2 (u) = 0, (3.25) T a (u)+t 2 a (u) = T (0) 1 (u+(a 1)/k)T (δa) 1 (u+( a+1)/k) +T (1) 1 (u+(a 1)/k)T (δ a 1) 1 (u+( a+1)/k), (3.26) T a (u)+t 2r a 2 (u) = T (r) 1 (u+(r a 1)/k)T (r δ r a) 1 (u+( r +a+1)/k) +T (r 1) 1 (u+(r a 1)/k)T (r δ r a 1) 1 (u+( r +a+1)/k). (3.27) Note that the functional equations (3.22), (3.24) and (3.26) are transfored into eqs.(3.23), (3.25) and (3.27) respectively under the following transforation (3.12). The origin of the function T a (u) in eq.(3.23) goes back to auxiliary transfer atrix (or dress function in the analytic Bethe ansatz) for U q (B r (1) ) vertex odel. Actually, the functional relation (3.23) for k = 1 with the boundary condition 0 a < 0 T a (u) = 1 a = 0 1 (u) 1 a r 1 12 (3.28)

was firstly introduced in ref.[3]. The origin of the function T a (u) in eq.(3.27) goes back to auxiliary transfer atrix (or dress function in the analytic Bethe ansatz) for U q (D r (1) ) vertex odel. Actually, the functional relation (3.27) for k = 1 with the boundary condition 0 a < 0 T a (u) = 1 a = 0 (3.29) 1 (u) 1 a r 2 was firstly introduced in ref.[7]. Reark1 : Under the functional relation (3.26) (resp., (3.27)), the following relations for p = 1 (resp., p = 2) hold. where C +1(k u) [p] = S +1(k u) [p] +1 P(1,j; y j 1(k u)), [p] (3.30) R [p] +1(k u) = ( +1 i=2 j=2 P(i,1;y [p] i 1(k u)) ) S [p] +1(k u) (3.31) P(i,j;c) = I +ci ij (3.32) is the + 1 by + 1 atrix with I the identity and I ij the atrix unit. Naely, the atrices C +1(k u) [p] and R [p] +1(k u) can be derived fro eleentary transforations to the atrix S +1(k u). [p] We further have F [1] under the functional relations (3.24), 2(k u) = t T2 1 1 (k u) = T2 (k u) (3.33) F [2] 2(k u) = T r+1 2 (k u) (3.34) under the functional relations (3.25), where the index t denotes transposition of a atrix. Reark2 : In deriving the solutions in section4, the paraeter k in this section is deterined by the value of t a = 2/(α a α a ), where t a = 1 if α a is the longest siple root of affine Lie algebra. 13

4 Solutions The solutions of our functional equations (2.1)-(2.48) are given as follows. Theore 4.1 (The A (1) r case, r 1) For Z 0, T (a) (u) = Ta (1 u) (4.1) solves the functional equations (2.1) under the condition T b+g (u) = T b (u), g = r +1, b Z. (4.2) Theore 4.2 (The B (1) r case, r 3) For Z 0, T (0) (u) = G(0) (u) = Ta (1 u), T(1) (u) = G(1) (1 u), (1 u), 2 a r 1, (4.3) T 2(u) (r) = T r (1 u), T(r) 2+1(u) = H +1(1 u) (r) solves the functional equations (2.2-2.8) under the relations (3.23) and (3.26) for k = 1. Theore 4.3 (The C (1) r case, r 2) For Z 0, T (0) (u) = F(0) (u) = Ta T (r) (u) = F (r) (2 u) (2 u), (2 u), 1 a r 1 (4.4) solves the functional equations (2.9-2.17) under the relations (3.24) and (3.25). Theore 4.4 (The D (1) r case, r 4) For Z 0, T (0) (u) = G (0) (1 u), T (1) (u) = G (1) (1 u), (u) = Ta T (r 1) (u) = G (r 1) (1 u), 2 a r 2, (4.5) (1 u), T(r) (u) = G(r) (1 u) solves the functional equations (2.18-2.23) under the relations (3.26) and (3.27) for k = 1. 14

Theore 4.5 (The A (2) 2r case, r 2) For Z 0, T (0) (u) = F(0) (2 u), T (a) (u) = Ta (2 u), 1 a r 1, (4.6) T 2(u) (r) = T r (2 u), T(r) 2+1(u) = H +1(2 u) (r) solves the functional equations (2.24-2.32) under the relations (3.23) and (3.24) for k = 2. Theore 4.6 (The A (2) 2r 1case, r 3) For Z 0, T (0) (u) = G (0) (2 u), T (1) (u) = G (1) (2 u), T (a) (u) = T(2 u), a 2 a r 1, (4.7) T (r) (u) = F(r) (2 u) solves the functional equations (2.33-2.40) under the relations (3.25) and (3.26) for k = 2. Theore 4.7 (The D (2) r+1 case, r 2) For Z 0, T 2(u) (0) = T(1 u), 0 T 2+1(u) (0) = H +1(1 u), (0) T (a) (u) = Ta (1 u), 1 a r 1, (4.8) T 2(u) (r) = T(1 u), r T 2+1(u) (r) = H +1(1 u) (r) solves the functional equations (2.41-2.48) under the relations (3.22) and (3.23) for k = 1. Reark1 : In eqs.(4.1)-(4.8), the following type of boundary conditions are valid. For α a β, T a (u) = 1 (u) where (α,β) = (0,r) for (4.1); (α,β) = (2,r 1) for (4.3); (α,β) = (0,r) for (4.4); (α,β) = (2,r 2) for (4.5); (α,β) = (0,r 1) for (4.6); (α,β) = (2,r) for (4.7); (α,β) = (1,r 1) for (4.8). Reark2 : In eq.(4.1), if 1 (u) does not depend on u C for all a, then the following truncation holds: T (b) g (u) = 0 for any b. Now we enuerate leas that are necessary for the proofs of the theores. 15

Lea 4.8 For Z 0 and u C, F (0) (k u) (3.14) (resp., F(r) (k u) (3.15)) satisfy the following relations for α = 0 (resp., α = r) under the relation (3.24) (resp., (3.25)). F (α) (k u 1/k)F (α) (k u+1/k) = T α 2(k u), (4.9) F (α) (k u)f(α) +1(k u) = T2+1 α (k u). (4.10) Lea 4.9 For Z 1, G (1) (k u) (3.17) and G (0) (k u) (3.16) (resp., G (r 1) (k u) (3.19) and G(r) (k u) (3.18) ) satisfy the following relations for (p,α,β) = (1,1,0) (resp., (p,α,β) = (2,r 1,r)) under the relation (3.26) (resp., (3.27)). G (α) (k u+1/k)g(β) 1(k u) [ ] det[s [p] +1 +1 (k u+( +2)/k)] for 2Z 1 1 = [ ] det[s [p] 2 +2 +2 (k u /k)] for 2Z 1 2 0 +1, (4.11) [ G (α) (k u)g(β) (k u) = ( 1) det[s [p] 1 +1 1 [ G (α) (k u+1/k)g(β) +1(k u) = ( 1) +1 det[s [p] 1 +2 2 ] (k u+( +1)/k)], (4.12) ] (k u /k)], (4.13) G (α) 1(k u)g (α) (k u+1/k) (4.14) [ ] = ( 1) det[s [p] 1 2 +2 (k u /k)], 2 +2 G (β) 1(k u 1/k)G (β) (k u) = ( 1) det[s [p] +1 [ 1 +1 ] (k u+( +1)/k)], (4.15) G (α) (k u)g 1(k u (β) + 1/k) (4.16) [ ] = ( 1) det[s [p] 1 2 +2 (k u+( 1)/k)]. 2 3 16

Reark3 : Lea 4.8 for α = r,k = 1 with different boundary condition for T a (u) was firstly proved in ref.[6]. Reark4 : Lea 4.9 for (p,α,β,k) = (2,r 1,r,1) with different boundary condition(3.29) for T a (u) was firstly proved in ref.[7]. The proofs of the theores and leas in this section are quite siilar to those in earlier work on solutions of the T-syste [6, 3, 7]. That is, ost of the reduce to the Jacobi identity: detm [ b b ] detm [ c c ] detm [ b c ] detm So we shall not go into the detailed proofs here. 5 Suary and Discussion [ c b ] = detm (b c). [ b c b c ] detm, In this paper, we have given the generalization of a discretized Toda equation. Although the origin of it goes back to the T-syste, a faily of transfer atrix functional equations, it has nothing to do with the solvable lattice odels to the author knowledge. It can be looked upon as a discretized affine Toda field equation. Solving it recursively, we have given, for A (1) n, B n (1), C n (1), D n (1), A (2) n and D n+1, (2) its solutions in ters of deterinants or pfaffians. Fro the point of view of representation theory, the solutions of the T- syste [3, 6, 7] are considered to be Yangian analogue of the Jacobi-Trudi forulae, that is, Yangian character forulae in ters of fundaental representations. Then, what kind of underlying structures our new solutions here indicating? Whether we can understand the within the fraework of Yangian (or quantu affine algebras) or not is an open proble. There are related papers refs. [3, 7, 26, 27, 28, 29, 30]. There reain probles to solve the functional equations associated with other Kac-Moody Lie algebras. Acknowledgents The author would like to thank Prof. A. Kuniba for useful discussions and coents on the anuscript, Prof. R. Hirota and Dr. S. Tsujioto for kind interests in this work. 17

A List of functional equations for other affine Lie algebras For G (1) 2, T (0) (u 1)T (0) (u+1) = T +1(u)T (0) 1(u)+T (0) (1) (u) (A.1) T (1) (u 1)T(1) (u+1) = T(1) +1(u)T 1(u)+T (1) (0) (u)t(2) 3(u) (A.2) T 3(u 1/3)T (2) 3(u+1/3) (2) = T 3+1(u)T (2) 3 1(u)+T (2) (1) (u 2/3)T (1) (u)t (1) (u+2/3) (A.3) T 3+1(u 1/3)T (2) 3+1(u (2) + 1/3) = T 3+2(u)T (2) 3(u)+T (2) (1) (u 1/3)T(1) (u+1/3)t(1) +1(u) (A.4) T 3+2(u 1/3)T (2) 3+2(u (2) + 1/3) = T 3+3(u)T (2) 3+1(u)+T (2) (1) (u)t(1) +1(u 1/3)T +1(u+1/3) (1) (A.5) For F (1) 4, T (0) (u+1) = T(0) +1(u)T 1(u)+T (0) (1) (A.6) T (1) (u 1)T (1) (u+1) = T +1(u)T (1) 1(u)+T (1) (0) (u)t (2) (u) (A.7) T (2) (u+1) = T(2) +1(u)T 1(u)+T (2) (1) 2(u) (A.8) T 2(u 1/2)T (3) 2(u+1/2) (3) = T 2+1(u)T (3) 2 1(u)+T (3) (2) (u 1/2)T (2) (u+1/2)t 2(u) (4) (A.9) T 2+1(u 1/2)T (3) 2+1(u (3) + 1/2) = T 2+2(u)T (3) 2(u)+T (3) (2) +1(u)T 2+1(u) (4) (A.10) T (4) (u 1/2)T (4) (u+1/2) = T +1(u)T (4) 1(u)+T (4) (3) (u) (A.11) For E (1) 6, T (0) (u 1)T(0) (u+1) = T(0) +1(u)T 1(u)+T (0) (6) (u) (A.12) (u 1)T(a) (u+1) = T(a) +1(u)T 1(u)+ (a 1) (u)t (a+1) (u), (A.13) We had reoved this appendix fro the published version. 18

a = 2,4 T (1) (u 1)T(1) (u+1) = T(1) +1(u)T 1(u)+T (1) (2) (u) (A.14) T (3) (u 1)T(3) (u+1) = T(3) +1(u)T 1(u)+T (3) (2) (u)t(4) (u)t(6) (u) (A.15) T (5) (u 1)T (5) (u+1) = T +1(u)T (5) 1(u)+T (5) (4) (u) (A.16) T (6) (u 1)T(6) (u+1) = T(6) +1(u)T 1(u)+T (6) (0) (u)t(3) (u) (A.17) For E (1) 7, T (0) (u 1)T(0) (u+1) = T(0) +1(u)T 1(u)+T (0) (1) (u) (A.18) T (a) (u 1)T (a) (u+1) = T +1(u) 1(u)+ (a 1) (u)t (a+1) (u), (A.19) a = 1,2,4,5 T (3) (u 1)T(3) (u+1) = T(3) +1(u)T 1(u)+T (3) (2) (u)t(4) (u)t(7) (u) (A.20) T (6) (u 1)T(6) (u+1) = T(6) +1(u)T 1(u)+T (6) (5) (u) (A.21) T (7) (u 1)T (7) (u+1) = T +1(u)T (7) 1(u)+T (7) (3) (u) (A.22) For E (1) 8, T (0) (u 1)T(0) (u+1) = T(0) +1(u)T 1(u)+T (0) (7) (u) (A.23) T (a) (u 1)T(a) (u+1) = T(a) +1(u)T 1(u)+ (a 1) (u)t (a+1) (u), (A.24) a = 2,4,5,6 T (1) (u 1)T (1) (u+1) = T +1(u)T (1) 1(u)+T (1) (2) (u) (A.25) T (3) (u 1)T(3) (u+1) = T(3) +1(u)T 1(u)+T (3) (2) (u)t(4) (u)t(8) (u) (A.26) T (7) (u 1)T(7) (u+1) = T(7) +1(u)T 1(u)+T (7) (0) (u)t(6) (u) (A.27) T (8) (u 1)T (8) (u+1) = T +1(u)T (8) 1(u)+T (8) (3) (u) (A.28) For E (2) 6, T (0) (u 1/2)T(0) (u+1/2) = T(0) +1(u)T 1(u)+T (0) (1) (u) T (1) (u 1/2)T(1) (u+1/2) = T(1) +1(u)T 1(u)+T (1) (0) (u)t(2) (u) T 2(u 1/2)T (2) 2(u+1/2) (2) (A.29) (A.30) 19

= T 2+1(u)T (2) 2 1(u)+T (2) 2(u)T (1) (3) (u 1/2)T(3) (u+1/2) (A.31) T 2+1(u 1/2)T (2) 2+1(u (2) + 1/2) = T 2+2(u)T (2) 2(u)+T (2) 2+1(u)T (1) (3) (u)t(3) +1(u) (A.32) T (3) (u 1)T(3) (u+1) = T(3) +1(u)T 1(u)+T (3) 2(u)T (2) (4) (u) (A.33) T (4) (u 1)T (4) (u+1) = T +1(u)T (4) 1(u)+T (4) (3) (u) (A.34) For D (3) 4, T (0) (u 1/3)T(0) (u+1/3) = T(0) +1(u)T 1(u)+T (0) (1) (u) (A.35) T 3(u 1/3)T (1) 3(u+1/3) (1) = T 3+1(u)T (1) 3 1(u)+T (1) 3(u)T (0) (2) (u 2/3)T(2) (u)t(2) (u+2/3) (A.36) T 3+1(u 1/3)T (1) 3+1(u (1) + 1/3) = T 3+2(u)T (1) 3(u)+T (1) 3+1(u)T (0) (2) (u 1/3)T(2) (u+1/3)t(2) +1(u) (A.37) T 3+2(u 1/3)T (1) 3+2(u+1/3) (1) = T 3+3(u)T (1) 3+1(u) (1) +T 3+2(u)T (0) (2) (u)t(2) +1(u 1/3)T +1(u (2) + 1/3) (A.38) T (2) (u 1)T(2) (u+1) = T(2) +1(u)T 1(u)+T (2) 3(u) (1) (A.39) 20

References [1] A. Kuniba, T. Nakanishi and J. Suzuki: Int. J. Mod. Phys.A9 (1994) 5215. [2] A. Kuniba, T. Nakanishi and J. Suzuki: Int. J. Mod. Phys. A9 (1994) 5267. [3] A. Kuniba, Y. Ohta and J. Suzuki: J. Phys. A28 (1995) 6211. [4] A. N. Leznov and M. V. Saveliev: Lett. Math. Phys. 3 (1979) 489. [5] A. V. Mikhailov, M. A. Olshanetsky and A. M. Pereloov: Coun. Math. Phys. 79 (1981) 473. [6] A. Kuniba, S. Nakaura and R. Hirota:J. Phys. A29 (1996) 1759. [7] Z. Tsuboi and A. Kuniba: J. Phys. A29 (1996) 7785. [8] M. J. Ablowitz and F. J. Ladik: Stud. Appl. Math. 55 (1976) 213. [9] M. J. Ablowitz and F. J. Ladik: Stud. Appl. Math. 57 (1977) 1. [10] E. Date, M. Jibo and T. Miwa: J. Phy. Soc. Jpn. 51 (1982) 4116. [11] E. Date, M. Jibo and T. Miwa: J. Phy. Soc. Jpn. 51 (1982) 4125. [12] E. Date, M. Jibo and T. Miwa: J. Phy. Soc. Jpn. 52 (1983) 388. [13] E. Date, M. Jibo and T. Miwa: J. Phy. Soc. Jpn. 52 (1983) 761. [14] E. Date, M. Jibo and T. Miwa: J. Phy. Soc. Jpn. 52 (1983) 766. [15] R. Hirota: J. Phy. Soc. Jpn. 43 (1977) 1424. [16] R. Hirota: J. Phy. Soc. Jpn. 45 (1978) 321. [17] R. Hirota: J. Phy. Soc. Jpn. 50 (1981) 3785. [18] R. Hirota: J. Phy. Soc. Jpn. 56 (1987) 4285. 21

[19] R. Hirota, S. Tsujioto and T. Iai: Future Directions of Nonlinear Dynaics in Physical and Biological Systes, Nato ASI Series, 1992, ed. P. L. Christiansen, J. C. Eilbeck and R. D. Parentier (Plenu Press, New York, 1993). [20] Yu. B. Suris: Phys. Lett. 145A (1990) 113. [21] Yu. B. Suris: Phys. Lett. 156A (1991) 467. [22] R. S. Ward: Phys. Lett. 199A (1995) 45. [23] A. Kuniba and J. Suzuki: J. Phys. A 28 (1995) 711. [24] A. Kuniba and J. Suzuki: Coun. Math. Phys. 173(1995) 225. [25] N. Yu. Reshetikhin: Sov. Phys. JETP 57 (1983) 691. [26] Z. Tsuboi: preprent, UT-Koaba/97-8: J. Phys. A 30 (1997) 7975. [27] I. Krichever, O. Lipan, P. Wiegann and A. Zabrodin: Coun. Math. Phys. 188 (1997) 267. [28] P. Wiegann: preprent, cond-at/9610132. [29] A. Zabrodin: preprent, hep-th/9607162. [30] A. Zabrodin: preprent, hep-th/9610039. 22