2000 character limit reached
KdV solves BKP (2012.10448v1)
Published 20 Dec 2020 in nlin.SI, hep-th, math-ph, and math.MP
Abstract: In this note, we prove that any tau-function of the KdV hierarchy also solves the BKP hierarchy after a simple rescaling of times.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run paper prompts using GPT-5.