Nonautonomous ultradiscrete hungry Toda lattice and a generalized box-ball system
arXiv:1703.06709 · doi:10.1088/1751-8121/aa8204
Abstract
A nonautonomous version of the ultradiscrete hungry Toda lattice with a finite lattice boundary condition is derived by applying reduction and ultradiscretization to a nonautonomous two-dimensional discrete Toda lattice. It is shown that the derived ultradiscrete system has a direct connection to the box-ball system with many kinds of balls and finite carrier capacity. Particular solutions to the ultradiscrete system are constructed by using the theory of some sort of discrete biorthogonal polynomials.
arXiv comment28 pages, 4 figures
References in corpus (7)
- The A^{(1)}_M automata related to crystals of symmetric tensors
- Faces of Relativistic Toda Chain
- Multidimensional Toda Lattices: Continuous and Discrete Time
- Discrete Spectral Transformations of Skew Orthogonal Polynomials and Associated Discrete Integrable Systems
- A generalized eigenvalue algorithm for tridiagonal matrix pencils based on a nonautonomous discrete integrable system
- Direct Connection between the R_{II} Chain and the Nonautonomous Discrete Modified KdV Lattice
- A finite Toda representation of the box-ball system with box capacity