SIGMA, 2018, Volume 14, 059, 14 pages
This article is cited in 1 scientific paper (total in 1 paper)
Dressing the Dressing Chain
Charalampos A. Evripidoua, Peter H. van der Kampa, Cheng Zhangb
a Department of Mathematics and Statistics, La Trobe University,
Melbourne, Victoria 3086, Australia
b Department of Mathematics, Shanghai University, 99 Shangda Road, Shanghai 200444, China
The dressing chain is derived by applying Darboux transformations to the spectral problem of the Korteweg–de Vries (KdV) equation. It is also an auto-Bäcklund transformation for the modified KdV equation. We show that by applying Darboux transformations to the spectral problem of the dressing chain one obtains the lattice KdV equation as the dressing chain of the dressing chain and, that the lattice KdV equation also arises as an auto-Bäcklund transformation for a modified dressing chain. In analogy to the results obtained for the dressing chain (Veselov and Shabat proved complete integrability for odd dimensional periodic reductions), we
study the $(0,n)$-periodic reduction of the lattice KdV equation, which is a two-valued correspondence. We provide explicit formulas for its branches and establish complete integrability for odd $n$.
discrete dressing chain; lattice KdV; Darboux transformations; Liouville integrability.
PDF file (360 kB)
MSC: 35Q53; 37K05; 39A14
Received: April 18, 2018; in final form June 4, 2018; Published online June 15, 2018
Charalampos A. Evripidou, Peter H. van der Kamp, Cheng Zhang, “Dressing the Dressing Chain”, SIGMA, 14 (2018), 059, 14 pp.
Citation in format AMSBIB
\by Charalampos~A.~Evripidou, Peter~H.~van der Kamp, Cheng~Zhang
\paper Dressing the Dressing Chain
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
G. S. Mauleshova, “The dressing chain and one-point commuting difference operators of rank 1”, Siberian Math. J., 59:5 (2018), 901–908
|Number of views:|