Cells in Coxeter groups. I.

From MaRDI portal



Abstract: The purpose of this article is to shed new light on the combinatorial structure of Kazhdan-Lusztig cells in infinite Coxeter groups W. Our main focus is the set D of distinguished involutions in W, which was introduced by Lusztig in one of his first papers on cells in affine Weyl groups. We conjecture that the set D has a simple recursive structure and can be enumerated algorithmically starting from the distinguished involutions of finite Coxeter groups. Moreover, to each element of D we assign an explicitly defined set of equivalence relations on W that altogether conjecturally determine the partition of W into left (right) cells. We are able to prove these conjectures only in a special case, but even from these partial results we can deduce some interesting corollaries.


The set \(\mathcal D\) of distinguished involutions in a Coxeter group \(W\) was introduced by Lusztig, which plays an important role in the study of Kazhdan-Lusztig cells of \(W\). The paper under review is concerned with the combinatorial structure of cells in an infinite Coxeter group \(W\) under a certain hypothesis. For such a Coxeter group \(W\), the authors first conjecture that the set \(\mathcal D\) has a simple recursive structure and can be enumerated algorithmically starting from the distinguished involutions of finite Coxeter groups. Then they consider some special cases for supporting their conjectures.











This page was built for publication: Cells in Coxeter groups. I.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2438456)