Generalization of the Dehornoy-Lafont order complex to categories: application to exceptional braid groups (Q6185819)

The homology of a Garside monoid, thus of a Garside group, can be computed efficiently through the use of the order complex defined by \textit{P. Dehornoy} and \textit{Y. Lafont} [Ann. Inst. Fourier 53, No. 2, 489--540 (2003; Zbl 1100.20036)]. In the paper under review the author constructs a categorical generalization of this complex and he gives some computational techniques which are useful for reducing computing time. Then the author uses this construction to complete results of \textit{M. Salvetti} [Math. Res. Lett. 1, No. 5, 565--577 (1994; Zbl 0847.55011)] and \textit{F. Callegaro} and \textit{I. Marin} [J. Eur. Math. Soc. (JEMS) 16, No. 1, 103--164 (2014; Zbl 1302.20049)] regarding the homology of exceptional complex braid groups. Furthermore, he studies the case of the Borchardt braid group \(B(G_{31})\) through its associated Garside category.