Left-connectedness of some left cells in certain Coxeter groups of simply-laced type. (Q2474279): Difference between revisions
From MaRDI portal
Latest revision as of 17:22, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Left-connectedness of some left cells in certain Coxeter groups of simply-laced type. |
scientific article |
Statements
Left-connectedness of some left cells in certain Coxeter groups of simply-laced type. (English)
0 references
5 March 2008
0 references
Let \(W\) be an irreducible finite or affine Weyl group of simply-laced type generated by \(S\); \(a(w)\) Lusztig's function; \(l(w)\) the length of the element \(w\), i.e. the number of factors in the minimal presentation; \(W_J\) the subgroup of \(W\) generated by \(J\subseteq S\) and \(w_J\) the longest element of \(W_J\). Then it is shown that any \(w\in W\) with \(a(w)\geq 6\) satisfies Condition (C): \(w=x\cdot w_J\cdot y\) for some \(x,y\in W\), with \(W_J\) finite and \(l(w_J)=a(w)\). It is also shown that if \(L\) is a left cell of \(W\) all of whose elements satisfy Condition (C), then the distinguished involution \(d_L\) of \(W\) in \(L\) satisfies \(d_L=\lambda(z^{-1},z)=z^{\prime-1}\cdot w_J\cdot z'\) for any \(z=w_J\cdot z'\in E_{\min}(L)\) with \(J=L(z)\). If \(E(L)=E_{\min}(L)\) then the left cell \(L\) is left-connected. Here \(L(w)=\{s\in S\mid sw<w\}\), \(E(L)=\{w\in L\mid sw\not\in L\), \(\forall s\in L(w)\}\) and \(E_{\min}(L)=\{w\in L\mid l(w)\leq l(x)\), \(\forall x\in L\}\). \(\lambda(x,y)\) is the maximal element \(z\) such that \(h_{x,y,z}\neq 0\), for the given \(x,y\in W\).
0 references
left cells
0 references
\(a\)-function
0 references
distinguished involutions
0 references
left-connected cells
0 references
Weyl groups of simply-laced type
0 references