A combinatorial derivation of the Poincaré polynomials of the finite irreducible Coxeter groups (Q5946749)

From MaRDI portal
Revision as of 08:51, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1659496
Language Label Description Also known as
English
A combinatorial derivation of the Poincaré polynomials of the finite irreducible Coxeter groups
scientific article; zbMATH DE number 1659496

    Statements

    A combinatorial derivation of the Poincaré polynomials of the finite irreducible Coxeter groups (English)
    0 references
    0 references
    30 January 2003
    0 references
    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.
    0 references
    finite irreducible Coxeter groups
    0 references
    weak Bruhat orders
    0 references
    Poincaré polynomials
    0 references
    reduced words
    0 references
    parabolic subgroups
    0 references
    coset representatives
    0 references
    labeled Hasse diagrams
    0 references

    Identifiers