Geodesic containment conjecture for the Tamari lattice

Let T1T_1 and T2T_2 be trees with an upper bound in the Tamari lattice Cn\mathscr{C}_n, and let Rn\mathscr{R}_n be the rotation graph on these trees. A shortest path in Rn\mathscr{R}_n from T1T_1 to T2T_2 also lies in Cn\mathscr{C}_n. This asserts that whenever the endpoints have a common upper bound in the Tamari lattice, an ambient shortest rotation path remains entirely within the Tamari lattice. The preceding result establishes the minimum path length and characterizes the moves in any shortest path, but the supplied text does not establish this containment claim.

Sources & referencesView supporting material

Primary source

Sebastian A. Csar, Rik Sengupta and Warut Suksompong, “On a Subposet of the Tamari Lattice”, arXiv:1108.5690 (2013).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.