KP constraints from reduced multi-component hierarchies

  • R. Willox
    Graduate School of Mathematical Sciences, University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo 153-8914, Japan
  • I. Loris
    Dienst Theoretische Natuurkunde, Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussels, Belgium

書誌事項

公開日
1999-12-01
DOI
  • 10.1063/1.533104
公開者
AIP Publishing

この論文をさがす

説明

<jats:p>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.</jats:p>

収録刊行物

被引用文献 (3)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ