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.
Biagioli, R., Perrone, L. (2026). Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach [10.4204/EPTCS.445.4].
Computing Joins in the Weak Order of Type B Coxeter Groups: an Algorithmic Approach
Biagioli R.Writing – Original Draft Preparation
;
2026
Abstract
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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
unpaywall-bitstream--732367614.pdf
accesso aperto
Tipo:
Versione (PDF) editoriale / Version Of Record
Licenza:
Creative commons
Dimensione
224.32 kB
Formato
Adobe PDF
|
224.32 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.



