English

On maximal dihedral reflection subgroups and generalized noncrossing partitions

Group Theory 2023-08-01 v1 Combinatorics

Abstract

In this note, we give a new proof of a result of Matthew Dyer stating that in an arbitrary Coxeter group WW, every pair t,tt,t' of distinct reflections lie in a unique maximal dihedral reflection subgroup of WW. Our proof only relies on the combinatorics of words, in particular we do not use root systems at all. As an application, we deduce a new proof of a recent result of Delucchi-Paolini-Salvetti, stating that the poset [1,c]T[1,c]_T of generalized noncrossing partitions in any Coxeter group of rank 33 is a lattice. We achieve this by showing the more general statement that any interval of length 33 in the absolute order on an arbitrary Coxeter group is a lattice. This implies that the interval group attached to any interval [1,w]T[1,w]_T where ww is an element of an arbitrary Coxeter group with T(w)=3\ell_T(w)=3 is a quasi-Garside group.

Keywords

Cite

@article{arxiv.2307.16791,
  title  = {On maximal dihedral reflection subgroups and generalized noncrossing partitions},
  author = {Thomas Gobet},
  journal= {arXiv preprint arXiv:2307.16791},
  year   = {2023}
}

Comments

5 pages, comments welcome !

R2 v1 2026-06-28T11:44:37.494Z