KdV type hierarchies, the string equation and W1+∞ constraints
Abstract
To every partition n=n1+n2+·s+ns one can associate a vertex operator realization of the Lie algebras a∞ and gln. Using this construction we make reductions of the s--component KP hierarchy, reductions which are related to these partitions. In this way we obtain matrix KdV type equations. Now assuming that (1) τ is a τ--function of the [n1,n2,…,ns]--th reduced KP hierarchy and (2) τ satisfies a `natural' string equation, we prove that τ also satisfies the vacuum constraints of the W1+∞ algebra.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.