Combinatorial descriptions of biclosed sets in affine type

TL;DR

This paper classifies all biclosed sets in affine root systems, providing uniform descriptions and models for classical types, and proves that these sets form a complete lattice in certain affine types, advancing understanding of Coxeter group structures.

Contribution

It offers a comprehensive classification of biclosed sets in affine root systems and proves their lattice structure in specific types, addressing a conjecture by Matthew Dyer.

Findings

Classified all biclosed sets in affine root systems.

Provided uniform descriptions and models for classical affine types.

Proved biclosed sets form a complete lattice in types \widetilde{A} and \widetilde{C}.

Abstract

Let $W$ be a Coxeter group and let $\Phi^+$ be its positive roots. A subset $B$ of $\Phi^+$ is called biclosed if, whenever we have roots $\alpha$, $\beta$ and $\gamma$ with $\gamma \in \mathbb{R}_{>0} \alpha + \mathbb{R}_{>0} \beta$, if $\alpha$ and $\beta \in B$ then $\gamma \in B$ and, if $\alpha$ and $\beta \not\in B$, then $\gamma \not\in 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 $\Phi^+$, 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 $\widetilde{A}$, $\widetilde{B}$, $\widetilde{C}$, $\widetilde{D}$. We use our models to prove that biclosed sets form a complete lattice in types $\widetilde{A}$ and $\widetilde{C}$.