2000 character limit reached
Lagrangian multiforms for Kadomtsev-Petviashvili (KP) and the Gelfand-Dickey hierarchy
Published 9 Nov 2020 in nlin.SI, math-ph, and math.MP | (2011.04543v3)
Abstract: We present, for the first time, a Lagrangian multiform for the complete Kadomtsev-Petviashvili (KP) hierarchy -- a single variational object that generates the whole hierarchy and encapsulates its integrability. By performing a reduction on this Lagrangian multiform, we also obtain Lagrangian multiforms for the Gelfand-Dickey hierarchy of hierarchies, comprising, amongst others, the Korteweg-de Vries and Boussinesq hierarchies.
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.
