Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polynomial tau-functions for the multi-component KP hierarchy (1901.07763v2)

Published 23 Jan 2019 in math-ph, hep-th, and math.MP

Abstract: In a previous paper we constructed all polynomial tau-functions of the 1-component KP hierarchy, namely, we showed that any such tau-function is obtained from a Schur polynomial $s_\lambda(t)$ by certain shifts of arguments. In the present paper we give a simpler proof of this result, using the (1-component) boson-fermion correspondence. Moreover, we 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. We also find all polynomial tau-functions for the reduction of the s-component KP hierarchy, associated to any partition consisting of s positive parts.

Summary

We haven't generated a summary for this paper yet.