Papers
Topics
Authors
Recent
Search
2000 character limit reached

KP solitons, higher Bruhat and Tamari orders

Published 16 Oct 2011 in math.CO, math-ph, math.MP, and nlin.SI | (1110.3507v2)

Abstract: In a tropical approximation, any tree-shaped line soliton solution, a member of the simplest class of soliton solutions of the Kadomtsev-Petviashvili (KP-II) equation, determines a chain of planar rooted binary trees, connected by right rotation. More precisely, it determines a maximal chain of a Tamari lattice. We show that an analysis of these solutions naturally involves higher Bruhat and higher Tamari orders.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.