The absolute order of a permutation representation of a Coxeter group (Q2441565)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The absolute order of a permutation representation of a Coxeter group
scientific article

    Statements

    The absolute order of a permutation representation of a Coxeter group (English)
    0 references
    0 references
    25 March 2014
    0 references
    Let \(W\) be a Coxeter group and \(T\) be its set of reflections. The absolute length of \(w \in W\), denoted by \(\ell_T(w)\), is the minimum length of a \(T\)-word of \(w\). Then, the absolute order \(\mathrm{Abs}(W)\) on \(W\) is the partial order \((W, \leq_T)\) defined as follows: for \(u,v \in W\), \(u \leq_T v\) if \[ \ell_T(vu^{-1})=\ell_T(v)- \ell_T(u). \] This paper studies a generalization \(\mathrm{Abs}(X)\) of \(\mathrm{Abs}(W)\) for a \(W\)-set \(X\) with a transitive action or equivalently \(X=W/H\) with a subgroup \(H\) of \(W\). In particular, the authors describe properties of its rank generating polynomial \[ X_T (q) =\sum_{x \in X} q^{\ell_T(x)} \] and characterize modular subgroups \(H\) of \(W\). Here, a subgroup \(H\) of \(W\) is called modular if every left coset of \(H\) in \(W\) has a minimum in \(\mathrm{Abs}(W)\). The authors also give interesting examples, including a symmetric group action on perfect matchings, and an application to alternating subgroups.
    0 references
    0 references
    Coxeter group
    0 references
    group action
    0 references
    absolute order
    0 references
    rank generating polynomial
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references