Polynomial tau-functions for the multicomponent KP hierarchy (Q2119199): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1901.07763 / rank | |||
Normal rank |
Revision as of 02:08, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial tau-functions for the multicomponent KP hierarchy |
scientific article |
Statements
Polynomial tau-functions for the multicomponent KP hierarchy (English)
0 references
23 March 2022
0 references
In a previous paper [Jpn. J. Math. (3) 13, No. 2, 235--271 (2018; Zbl 1401.14209)], the authors constructed all polynomial tau-functions of the \(1\)-component KP hierarchy, namely, they showed that any such tau-function is obtained from a Schur polynomial \(s_\lambda(t)\) by certain shifts of arguments. In the present paper they give a simpler proof of this result, using the (\(1\)-component) boson-fermion correspondence. Moreover, they show that this approach can be applied to the \(s\)-component KP hierarchy, using the \(s\)-component boson-fermion correspondence, finding thereby all its polynomial tau-functions. The authors also find all polynomial tau-functions for the reduction of the \(s\)-component KP hierarchy, associated to any partition consisting of \(s\) positive parts. The paper is organized as follows. The first section is an introduction to the subject. Section 2 is devoted to the fermionic formulation of the KP hierarchy and Section 3 to the bosonic formulation of KP. Section 4 deals with polynomial solutions of KP. In Section 5 the authors introduce the \(s\)-component KP, where \(s\) is a positive integer. Section 6 is devoted to the \(n\)-KdV where \(n\) is an integer, \(n\geq2\). In Section 7 the authors consider a reduction of the \(s\)-component KP hierarchy, which describes the loop group orbit of \(SL_n\), where \(n=n_1+n_2+\cdots+n_s\), with \(n_1\geq n_2\geq\cdots\geq n_s\geq1\). The case \(s=1\) is the nth Gelfand-Dickey hierarchy. The case \(n=s=2\), i.e., \(n_1=n_2=1\), is the AKNS (or nonlinear Schrödinger) hierarchy. Section 8 is devoted to the AKNS hierarchy.
0 references
KP hierarchy
0 references
multicomponent KP
0 references
tau-functions
0 references
Schur polynomials
0 references