On commutation classes of reduced words in Weyl groups

被引：34

作者：

Bédard, R ^{[1
]}

机构：

[1] Univ Quebec, Dept Math, Montreal, PQ H3C 3P8, Canada

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1999年 / 20卷 / 06期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1006/eujc.1999.0296

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This paper is concerned with commutation classes of reduced words in Weyl groups. It is divided in three sections. In the first, we give a recursive formula for the number of reduced words in a commutation class. In the second, we give a tableau-like description of all the reduced words adapted to a quiver in the case of simply laced root system. In the last, we consider the case of the longest element w(0) for the symmetric group SS and illustrate the fact that the set of commutation classes of reduced words of w(0) have nice symmetries and a topological structure. (C) 1999 Academic Press.

引用

页码：483 / 505

页数：23