Abstract
The (m-vector) k-constrained Kadomtsev–Petviashvili (KP) hierarchy is shown to be a “pseudo”-reduction of the (m+1)-component KP hierarchy. To facilitate the implementation of this reduction on the level of the solutions, the typical multi-component KP solutions are mapped onto solutions of a Toda molecule-type equation from which (Wronskian and Grammian) solutions for the constrained KP hierarchy follow. The reduction of the associated linear systems is discussed and its importance for the choice of bilinear representation of the reduced systems is explained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
