English

Combinatorial descriptions of biclosed sets in affine type

Combinatorics 2025-02-07 v2 Group Theory

Abstract

Let WW be a Coxeter group and let Φ+\Phi^+ be its positive roots. A subset BB of Φ+\Phi^+ is called biclosed if, whenever we have roots α\alpha, β\beta and γ\gamma with γR>0α+R>0β\gamma \in \mathbb{R}_{>0} \alpha + \mathbb{R}_{>0} \beta, if α\alpha and βB\beta \in B then γB\gamma \in B and, if α\alpha and β∉B\beta \not\in B, then γ∉B\gamma \not\in B. The finite biclosed sets are the inversion sets of the elements of WW, and the containment between finite inversion sets is the weak order on WW. 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 A~\widetilde{A}, B~\widetilde{B}, C~\widetilde{C}, D~\widetilde{D}. We use our models to prove that biclosed sets form a complete lattice in types A~\widetilde{A} and C~\widetilde{C}.

Keywords

Cite

@article{arxiv.2207.05998,
  title  = {Combinatorial descriptions of biclosed sets in affine type},
  author = {Grant T. Barkley and David E Speyer},
  journal= {arXiv preprint arXiv:2207.05998},
  year   = {2025}
}

Comments

24 pages, 3 figures