Combinatorial descriptions of biclosed sets in affine type
Combinatorics
2025-02-07 v2 Group Theory
Abstract
Let be a Coxeter group and let be its positive roots. A subset of is called biclosed if, whenever we have roots , and with , if and then and, if and , then . The finite biclosed sets are the inversion sets of the elements of , and the containment between finite inversion sets is the weak order on . 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 , , , . We use our models to prove that biclosed sets form a complete lattice in types and .
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