Combinatorial descriptions of biclosed sets in affine type
Abstract
Let W be a Coxeter group and let + be its positive roots. A subset B of + is called biclosed if, whenever we have roots α, β and γ with γ ∈ R>0 α + R>0 β, if α and β ∈ B then γ ∈ B and, if α and β ∈ B, then γ ∈ B. The finite biclosed sets are the inversion sets of the elements of W, and the containment between finite inversion sets is the weak order on W. Matthew Dyer suggested studying the poset of all biclosed subsets of +, ordered by containment, and conjectured that it is a complete lattice. As progress towards Dyer's conjecture, we classify all biclosed sets in the affine root systems. We provide both a type uniform description, and concrete models in the classical types A, B, C, D. We use our models to prove that biclosed sets form a complete lattice in types A and C.
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.