Metraipolis › archive › dc_8486ec038036
Bounded joins of biclosed sets — arXiv:2609.27253
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.27253
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:00:36.761Z
- SHA-256 of the archived text
278d9be5f6c17b480cc2d228ce6c07eacb07997c931c4928e75a3641385a5c06- Stable URL of this page
https://metraipolis.com/documento/dc_8486ec038036
How to cite
Bounded joins of biclosed sets — arXiv:2609.27253 — arXiv (en), https://arxiv.org/abs/2609.27253 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8486ec038036 (Metraipolis archive dc_8486ec038036, sha256 278d9be5f6c17b480cc2d228ce6c07eacb07997c931c4928e75a3641385a5c06)
BibTeX
@misc{dc8486ec038036,
title = {Bounded joins of biclosed sets — arXiv:2609.27253},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.27253},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8486ec038036; sha256 278d9be5f6c17b480cc2d228ce6c07eacb07997c931c4928e75a3641385a5c06},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27253. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Dyer conjectured that the join of two biclosed sets of positive roots can be described by increasing Bruhat paths whose reflection labels belong to their union. We give a type-uniform proof of this conjecture for all finite Coxeter groups. More generally, for a $2$-coclosed set $C$ of positive roots contained in an inversion set, we show that its $2$-closure is an inversion set $I(w)$ and that the elements reachable from the identity using reflections labeled by roots in $C$ form exactly the set $[e,w]_B w^{-1}$. The proof combines Dyer's closure criteria with a root-selection argument.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.27253 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:00:26.553Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).