On the fully commutative elements of Coxeter groups

被引:113
作者
Stembridge, JR [1 ]
机构
[1] UNIV MICHIGAN,DEPT MATH,ANN ARBOR,MI 48109
关键词
Coxeter group; reduced word; heap; weak order; Bruhat order;
D O I
10.1023/A:1022452717148
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let W be a Coxeter group. We define an element w is an element of W to be fully commutative if any reduced expression for w can be obtained from any other by means of braid relations that only involve commuting generators. We give several combinatorial characterizations of this property, classify the Coxeter groups with finitely many fully commutative elements, and classify the parabolic quotients whose members are all fully commutative. As applications of the latter, we classify all parabolic quotients with the property that (1) the Bruhat ordering is a lattice, (2) the Bruhat ordering is a distributive lattice, (3) the weak ordering is a distributive lattice, and (4) the weak ordering and Bruhat ordering coincide.
引用
收藏
页码:353 / 385
页数:33
相关论文
共 14 条
[11]  
Proctor RA., 1984, European J. Combin., V5, P331, DOI [10.1016/S0195-6698(84)80037-2, DOI 10.1016/S0195-6698(84)80037-2]
[12]  
Stanley R., 1986, ENUMERATIVE COMBINAT, V1
[13]  
STEMBRIDGE JR, IN PRESS T AM MATH S
[14]  
VIENNOT GX, 1986, LECT NOTES MATH, V1234, P321