On quotients of Coxeter groups under the weak order

AbstractWe consider quotients of finitely generated Coxeter groups under the weak order. Björner and Wachs proved that every such quotient is a meet semi-lattice, and in the finite case is a lattice [Björner and Wachs, Trans. Amer. Math. Soc. 308 (1988) 1–37]. Our result is that the quotient of an affine Weyl group by the corresponding finite Weyl group is a lattice, and that up to isomorphism, these are the only quotients of infinite Coxeter groups that are lattices. In this paper, we restrict our attention to the non-affine case; the affine case appears in [Waugh, Order 16 (1999) 77–87]. We reduce to the hyperbolic case by an argument using induced subgraphs of Coxeter graphs. Within each quotient, we produce a set of elements with no common upper bound, generated by a Maple program. The number of cases is reduced because the sets satisfy the following conjecture: if a set of elements does not have an upper bound in a particular Coxeter group, then it does not have an upper bound in any Coxeter group whose graph can be obtained from the graph of the original group by increasing edge weights