Word posets, with applications to Coxeter groups 英文论文文献.docVIP

Word posets, with applications to Coxeter groups Matthew J. Samuel Department of Mathematics Rutgers, the State University of New Jersey Piscataway, New Jersey, USA msamuel@ We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a ?rst application, it follows readily that counting words in com- mutation classes is #P-complete. We then apply the partially ordered sets to Coxeter groups. Some results are a proof that enumerating the reduced words of elements of Coxeter groups is #P-complete, a recursive formula for