A combinatorial derivation of the Poincaré polynomials of the finite irreducible Coxeter groups (Q5946749): Difference between revisions

Given a Coxeter system \((W,S)\) and a parabolic subgroup \(W_I\) for \(I\subset S\), the set of minimal right coset representatives is defined as \(V^I:=\{w\in W\mid l(sw)>l(w)\) for all \(s\in I\}\). The right weak Bruhat order `\(\leq\)' on \((W,S)\) is defined as the transitive closure of the following covering relation: \(w\prec w':\Leftrightarrow\exists s\in S:w'=ws\) and \(l(w')=l(w)+1\). The right order on \(W\) can be visualized using Hasse diagrams: the elements of \(W^{[N]}\) are depicted as points of level \(N\), where \(W^{[N]}:=\{w\in W\mid l(w)=N\}\), the root of level 0 is the identity \(\mathbf 1\), with edges drawn according to the covering relation. If one in addition labels the edges with their respective generators \(s\), then one has a labeled Hasse diagram (LHD). The author proves the following Theorem. For every \(w\in W\) and \(I\subset S\) there exists a unique \(u\in W_I\) and a unique \(v\in V^I\), such that \(w=uv\); in other words: \(W\) is the disjoint union of the sets \(uV^I\). But more can be said: for every \(I\subset S\) the \(\text{LHD}(W)\) can be partitioned into convex parts in the right weak Bruhat order, such that all parts are of the same form \(\text{LHD}(V^I)\) and every \(u\in W_I\) occurs exactly once as the bottom element of one of these parts. Applying the theorem the author derives the Poincaré polynomials of the finite irreducible Coxeter groups by an elementary combinatorial method avoiding the use of Lie theory and invariant theory. The author also describes non-recursive methods for the computation of ``standard reduced words'' for (signed) permutations.