Boolean intervals in the weak Bruhat order of a finite Coxeter group
Abstract
Given a Coxeter group W with Coxeter system (W,S), where S is finite. We provide a complete characterization of Boolean intervals in the weak order of W uniformly for all Coxeter groups in terms of independent sets of the Coxeter graph. Moreover, we establish that the number of Boolean intervals of rank k in the weak order of W is ik(W)·|W|\,/\,2k, where W is the Coxeter graph of W and ik(W) is the number of independent sets of size k of W when W is finite. Specializing to An, we recover the characterizations and enumerations of Boolean intervals in the weak order of An given in arXiv:2306.14734. We provide the analogous results for types Cn and Dn, including the related generating functions and additional connections to well-known integer sequences.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.