Dressing methods for geometric nets: II. Orthogonal and Egorov nets

From MaRDI portal





[For part I see: ibid., No.~14, 2871-2894 (2000; Zbl 0989.37061).] The Grassmannian formalism of KP hierarchies is used to study geometric nets of orthogonal type and their subclass of Egorov nets. Efficient dressing methods for Cauchy propagators are provided which lead to wide families of explicit nets. Frobenius manifolds and solutions to the Witten-Dijkgraff-Verlinde-Verlinde associativity equations are also constructed.











This page was built for publication: Dressing methods for geometric nets: II. Orthogonal and Egorov nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4523645)