Tamari lattices, forests and Thompson monoids
Zoran Sunic
Abstract
A connection relating Tamari lattices on symmetric groups regarded as lattices under the weak Bruhat order to the positive monoid P of Thompson group F is presented. Tamari congruence classes correspond to classes of equivalent elements in P. The two well known normal forms in P correspond to endpoints of intervals in the weak Bruhat order that determine the Tamari classes. In the monoid P these correspond to lexicographically largest and lexicographically smallest form, while on the level of permutations they correspond to 132-avoiding and 231-avoiding permutations. Forests appear naturally in both contexts as they are used to model both permutations and elements of the Thompson monoid. The connection is then extended to Tamari orders on partitions of ((k-1)n+2)-gons into (k+1)-gons and Thompson monoids Pk, k >1.
Create a lesson
Related papers
A face polynomial invariant for embedded graphs
Hongxia Ma, Metrose Metsidik
Odd-ordered Cayley graphs satisfy Erdős--Gyárfás
Michael C. Burkhart
The Maximum Second Zagreb Spectral Radius of Trees, Unicyclic Graphs and Bicyclic Graphs
Juan Wang, Genjie Wang
A Low-Diameter Nash-Williams--Tutte Theorem
Pin-Hsian Lee, Peng-Ting Lin, Meng-Tsung Tsai et al.
A Short Proof and Generalization of the Rainbow Cycle Theorem and Improved Bounds for Binary Even-Query LCCs
Andrew D. Lin
Automaticity of structural defects in fixed points of block substitutions
Lior Tenenbaum