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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.