Upper bounds in affine Weyl groups under the weak order (Q1970935)

From MaRDI portal
Revision as of 23:10, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Upper bounds in affine Weyl groups under the weak order
scientific article

    Statements

    Upper bounds in affine Weyl groups under the weak order (English)
    0 references
    0 references
    0 references
    17 October 2000
    0 references
    Let \((W,S)\) be a finitely generated Coxeter group. For \(w=s_1\cdots s_k\in W\), with \(s_i\in S\) for all \(i\) and \(k\) minimal, we say that \(s_1\cdots s_k\) is a reduced expression for \(w\) and \(l(w)=k\) is the length of \(w\). For \(x,y\in W\), we write \(x<_Ly\) if there is a reduced expression for \(y\) which ends with a reduced expression for \(x\). This partial ordering on \(W\) is called the (left) weak order. In [Trans. Am. Math. Soc. 308, No. 1, 1-37 (1988; Zbl 0659.05007)] \textit{A.~Björner} and \textit{M.~L.~Wachs} proved that under the weak order every quotient of a Coxeter group is a meet semi-lattice, and in the finite case is a lattice. In this paper, the author examines the case of an affine Weyl group \(W\) with corresponding finite Weyl group \(W_0\). In particular, the author shows that the quotient of \(W\) by \(W_0\) is a lattice and that up to isomorphism this is the only quotient of \(W\) which is a lattice. The author also determines that the question of which pairs of elements of \(W\) have upper bounds can be reduced to the analogous question within a particular finite subposet.
    0 references
    affine Weyl groups
    0 references
    lattices
    0 references
    upper bounds
    0 references
    finitely generated Coxeter groups
    0 references
    reduced expressions
    0 references
    weak orders
    0 references

    Identifiers