Abstract
The theory of multicomponent KP hierarchies is used to characterize explicit examples of Egorov nets. A $$\overline \partial $$ dressing method for Cauchy propagators is found to be particularly efficient.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
