A new algorithm for finding an l.c.r. set in certain two-sided cells. (Q433545)

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)\).