1994/11/10 by Johan van de Leur, Johan Van De Leur, Van De Leur, Johan · 2 citations
Computer Science · Physics and Astronomy · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Polynomial and algebraic computation #hep-th
paper · pdf · doi:10.48550/arxiv.hep-th/9411067
15 pages of (plain)tex, no figures
arxiv created 1994/11/10 · arxiv updated 2009/11/30
We study the BKP hierarchy and its n--reduction, for the case that n is odd. This is related to the principal realization of the basic module of the twisted affine Lie algebra sln(2). We show that the following two statements for a BKP τ function are equivalent: (1) τ is is n--reduced and satisfies the string equation, i.e. L-1τ=0, where L-1 is an element of some `natural' Virasoro algebra. (2) τ satisfies the vacuum constraints of the BW1+∞ algebra. Here BW1+∞ is the natural analog of the W1+∞ algebra, which plays a role in the KP case.