On quotients of Coxeter groups under the weak order (Q1398308): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Generalized Quotients in Coxeter Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bruhat lattices, plane partition generating functions, and minuscule representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fully commutative elements of Coxeter groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial aspects of reduced words in finite Coxeter groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds in affine Weyl groups under the weak order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quotients of Coxeter groups under the weak order / rank
 
Normal rank

Latest revision as of 17:32, 5 June 2024

scientific article
Language Label Description Also known as
English
On quotients of Coxeter groups under the weak order
scientific article

    Statements

    On quotients of Coxeter groups under the weak order (English)
    0 references
    0 references
    29 July 2003
    0 references
    Although Coxeter groups have fascinated mathematicians for many years, there are still many questions about them that need resolution. This paper contributes to the wealth of knowledge by resolving the following question: when does the quotient of an infinite Coxeter group form a lattice under the ordering \(x<y\) if and only if a reduced expression for \(x\) begins or ends a reduced expression for \(y\). The author has already shown that the quotient of an affine Weyl group by the corresponding finite Weyl group is a lattice, and here she confirms that this is all. To summarise she shows no quotient of an infinite non-affine Coxeter group is a lattice via the concept of ``forbidden configurations'', which a slick implementation of Maple is able to compute for all necessary cases.
    0 references
    non-affine Coxeter groups
    0 references
    hyperbolic Coxeter groups
    0 references
    lattices
    0 references
    forbidden configurations
    0 references
    affine Weyl groups
    0 references

    Identifiers