A new algorithm for finding an l.c.r. set in certain two-sided cells. (Q433545)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm for finding an l.c.r. set in certain two-sided cells. |
scientific article; zbMATH DE number 6053327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for finding an l.c.r. set in certain two-sided cells. |
scientific article; zbMATH DE number 6053327 |
Statements
A new algorithm for finding an l.c.r. set in certain two-sided cells. (English)
0 references
5 July 2012
0 references
Let \(W\) be an irreducible Weyl or affine Weyl group and let \(S\) be a set of generators for \(W\); let \(\Omega\) be a two-sided cell of \(W\). The author introduced an algorithm for finding a representative set of left cells of \(W\) in \(\Omega\); [see Tôhoku Math. J., II. Ser. 46, No. 1, 105-124 (1994; Zbl 0798.20040)]. In the present paper the author introduces a new more efficient algorithm for finding a representative set of left cells of \(W\) in \(\Omega\) using a certain set \(F(\Omega)\).
0 references
affine Weyl groups
0 references
left cells
0 references
two-sided cells
0 references
alcove forms
0 references
algorithms
0 references
