2000 character limit reached
KP solitons, higher Bruhat and Tamari orders (1110.3507v2)
Published 16 Oct 2011 in math.CO, math-ph, math.MP, and nlin.SI
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.