Affine extended weak order is a lattice
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915688855109632 |
|---|---|
| author | Barkley, Grant T. Speyer, David E |
| author_facet | Barkley, Grant T. Speyer, David E |
| contents | Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite Coxeter groups it is only a meet semi-lattice. Motivated by questions in Kazhdan-Lusztig theory, Matthew Dyer introduced a larger poset, now known as extended weak order, which contains the weak order as an order ideal and coincides with it for finite Coxeter groups. The extended weak order is the containment order on certain sets of positive roots: those which satisfy a geometric condition making them "biclosed". The finite biclosed sets are precisely the inversion sets of Coxeter group elements. Generalizing the result for finite Coxeter groups, Dyer conjectured that the extended weak order is always a complete lattice, even for infinite Coxeter groups.
In this paper, we prove Dyer's conjecture for Coxeter groups of affine type. To do so, we introduce the notion of a clean arrangement, which is a hyperplane arrangement where the regions are in bijection with biclosed sets. We show that root poset order ideals in a finite or rank 3 untwisted affine root system are clean. We set up a general framework for reducing Dyer's conjecture to checking cleanliness of certain subarrangements. We conjecture this framework can be used to prove Dyer's conjecture for all Coxeter groups. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2311_05737 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Affine extended weak order is a lattice Barkley, Grant T. Speyer, David E Combinatorics Group Theory 20F55 (Primary) 17B22, 06B23 (Secondary) Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite Coxeter groups it is only a meet semi-lattice. Motivated by questions in Kazhdan-Lusztig theory, Matthew Dyer introduced a larger poset, now known as extended weak order, which contains the weak order as an order ideal and coincides with it for finite Coxeter groups. The extended weak order is the containment order on certain sets of positive roots: those which satisfy a geometric condition making them "biclosed". The finite biclosed sets are precisely the inversion sets of Coxeter group elements. Generalizing the result for finite Coxeter groups, Dyer conjectured that the extended weak order is always a complete lattice, even for infinite Coxeter groups. In this paper, we prove Dyer's conjecture for Coxeter groups of affine type. To do so, we introduce the notion of a clean arrangement, which is a hyperplane arrangement where the regions are in bijection with biclosed sets. We show that root poset order ideals in a finite or rank 3 untwisted affine root system are clean. We set up a general framework for reducing Dyer's conjecture to checking cleanliness of certain subarrangements. We conjecture this framework can be used to prove Dyer's conjecture for all Coxeter groups. |
| title | Affine extended weak order is a lattice |
| topic | Combinatorics Group Theory 20F55 (Primary) 17B22, 06B23 (Secondary) |
| url | https://arxiv.org/abs/2311.05737 |