2000 character limit reached
Painlevé type reductions for the non-Abelian Volterra lattices
Published 18 Oct 2020 in nlin.SI, math-ph, and math.MP | (2010.09021v1)
Abstract: The Volterra lattice admits two non-Abelian analogs that preserve the integrability property. For each of them, the stationary equation for non-autonomous symmetries defines a constraint that is consistent with the lattice and leads to Painlev\'e-type equations. In the case of symmetries of low order, including the scaling and master-symmetry, this constraint can be reduced to second order equations. This gives rise to two non-Abelian generalizations for the discrete Painlev\'e equations dP$1$ and dP${34}$ and for the continuous Painlev\'e equations P$_3$, P$_4$ and P$_5$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.