Rhombic Tilings of Polygons and Classes of Reduced Words in Coxeter Groups
Rhombic Tilings of Polygons and Classes of Reduced Words in Coxeter Groups
复制标题
多边形的菱形平铺和 Coxeter 群中的简化词类
DOI:
10.1006/jcta.1997.2723
复制
发表时间:
1997
期刊:
影响因子:
--
通讯作者:
S. Elnitsky
中科院分区:
文献类型:
--
作者:
S. Elnitsky
In the standard Coxeter presentation, the symmetric groupSnis generated by the adjacent transpositions (1, 2), (2, 3), ?, (n?1, n). For any given permutation, we consider all minimal-length factorizations thereof as a product of the generators. Any two transpositions (i, i+1) and (j, j+1) commute if the numbersiandjare not consecutive; thus, in any factorization, their order can be switched to obtain another factorization of the same permutation. Extending this to an equivalence relation, we establish a bijection between the resulting equivalence classes and rhombic tilings of a certain 2n-gon determined by the permutation. We also study the graph structure induced on the set of tilings by the other Coxeter relations. For a special case, we use lattice-path diagrams to prove an enumerative conjecture by Kuperberg and Propp, as well as aq-analogue thereof. Finally, we give similar constructions for two other families of finite Coxeter groups, namely those of typesBandD.