کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4654511 1632837 2007 23 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Tamari lattices, forests and Thompson monoids
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Tamari lattices, forests and Thompson monoids
چکیده انگلیسی

A connection relating Tamari lattices on symmetric groups regarded as lattices under the weak Bruhat order to the positive monoid PP of Thompson group FF is presented. Tamari congruence classes correspond to classes of equivalent elements in PP. The two well known normal forms in PP correspond to endpoints of intervals in the weak Bruhat order that determine the Tamari classes. In the monoid PP these correspond to the lexicographically largest and the 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)((k−1)n+2)-gons into (k+1)(k+1)-gons and Thompson monoids Pk,k≥2Pk,k≥2.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 28, Issue 4, May 2007, Pages 1216–1238
نویسندگان
,