Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach
Electronic Proceedings in Theoretical Computer Science · 07.06.2026 · 445 · 21-28
DOI: 10.4204/eptcs.445.4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 07.06.2026. Verfasst von Riccardo Biagioli und 1 weiteren Autor:innen. Die Arbeit nennt 7 Literaturangaben.
Abstract (Originalsprache)
We present an algorithm for computing the join of two elements in the weak order of the Coxeter group of type B. This extends Markowsky's algorithm for computing joins of standard permutations to signed permutations, and allows us to confirm a conjecture of Dyer concerning a geometric interpretation of these joins.
Zitieren
APA
Biagioli, R., & Perrone, L. (2026). Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach. Electronic Proceedings in Theoretical Computer Science, 445, 21-28. https://doi.org/10.4204/eptcs.445.4
Vancouver
Biagioli R, Perrone L. Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach. Electronic Proceedings in Theoretical Computer Science. 2026;445:21-28. doi:10.4204/eptcs.445.4
BibTeX
@article{Biagioli2026,
author = {Biagioli, Riccardo and Perrone, Lorenzo},
title = {Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {445},
pages = {21--28},
doi = {10.4204/eptcs.445.4}
}
EUVIMED