Bi-infinite solutions for KdV- and Toda-type discrete integrable systems based on path encodings
David A. Croydon, Makiko Sasada, Satoshi Tsujimoto

TL;DR
This paper introduces bi-infinite solutions for four discrete integrable systems using path encodings, revealing their dynamics, reversibility, and connections through a unified approach.
Contribution
It develops a unified framework for bi-infinite solutions of discrete integrable models via path encodings, extending previous finite and semi-infinite analyses.
Findings
Existence of unique solutions within a broad class of initial data.
Characterization of system behavior via a generalization of Pitman's transformation.
Identification of links between ultra-discrete and discrete systems through ultra-discretization.
Abstract
We define bi-infinite versions of four well-studied discrete integrable models, namely the ultra-discrete KdV equation, the discrete KdV equation, the ultra-discrete Toda equation, and the discrete Toda equation. For each equation, we show that there exists a unique solution to the initial value problem when the given data lies within a certain class, which includes the support of many shift ergodic measures. Our unified approach, which is also applicable to other integrable systems defined locally via lattice maps, involves the introduction of a path encoding (that is, a certain antiderivative) of the model configuration, for which we are able to describe the dynamics more generally than in previous work on finite size systems, periodic systems and semi-infinite systems. In particular, in each case we show that the behaviour of the system is characterized by a generalization of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
