On a Conjecture of Dyer on the Join in the Weak Order of a Coxeter group
Riccardo Biagioli, Lorenzo Perrone
TL;DR
This work addresses Dyer's conjectures on the extended weak order of a Coxeter group, focusing on a finite-type reformulation of the join description and proving it for types $A$ (symmetric group) and $I$ (dihedral groups $I_2(m)$). The authors develop a reformulation using root-system data, inversion sets, and $(u,v)$-Bruhat paths, and establish the key equivalence between the original conjecture and its reformulation in finite type. For type $A$, they prove that the left-reflection set of the join satisfies $T_L(u\vee_R v)=T\cap V_W(u,v)$ by leveraging inversions and a transitive-closure property of $T_L$; for type $I_2(m)$ they perform a case analysis to verify the join description. They also report computational confirmations for types $H_3$ and $F_4$ via Sage and outline ongoing work toward a uniform proof across classical types, including potential geometric approaches. The results deepen the understanding of join operations in the extended weak order and connect combinatorial Bruhat-path descriptions with reflection-sets in finite Coxeter groups.
Abstract
In one of his papers on the weak order of Coxeter groups, Dyer formulates several conjectures. Among these, one affirms that the extended weak order forms a lattice, while another offers an algebraic-geometric description of the join of two elements in this poset. The former was recently proven for affine types by Barkley and Speyer. In this paper, we establish the latter for Coxeter groups of types $A$ and $I$. Moreover, we verified the validity of this conjecture for types $H_3$ and $F_4$ through the use of Sage.
