Generalization of the Dehornoy–Lafont Order Complex to Categories: Application to Exceptional Braid Groups

The homology of a Garside monoid, thus of a Garside group, can be computed efficiently through the use of the order complex defined by Dehornoy and Lafont. We construct a categorical generalization of this complex and we give some computational techniques which are useful for reducing computing time. We then use this construction to complete results of Salvetti, Callegaro and Marin regarding the homology of exceptional complex braid groups. We most notably study the case of the Borchardt braid group B(G31)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$B(G_{31})$$\end{document} through its associated Garside category.