arXiv · 2109.03869
On Hamiltonian Formalism for Dressing Chain Equations of Even Periodicity
Abstract
We propose a Hamiltonian formalism for $N$ periodic dressing chain with the even number $N$. The formalism is based on Dirac reduction applied to the $N+1$ periodic dressing chain with the odd number $N+1$ for which the Hamiltonian formalism is well known. The Hamilton dressing chain equations in the $N$ even case depend explicitly on a pair of conjugated Dirac constraints and are equivalent to $A^{(1)}_{N-1}$ invariant symmetric Painlev\'e equations.
Explore related subjects
Keep this discovery
H. Aratyn, J. F. Gomes, A. H. Zimerman. 2021-09-08. On Hamiltonian Formalism for Dressing Chain Equations of Even Periodicity. https://doi.org/10.46298/ocnmp.10161
Cite the original work for its findings. Save a collection to share your selection of sources.