activity
20002007
most citedZariski theorems and diagrams for braid groups

59 citations · 131 across the 13 of their papers we have counts for

collaborators

13 papers

math.CO2007★ 6 cited

Cyclic sieving of noncrossing partitions for complex reflection groups

David Bessis, Victor Reiner

We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.

math.GR2006★ 27 cited

Garside categories, periodic loops and cyclic sets

David Bessis

Garside groupoids, as recently introduced by Krammer, generalise Garside groups. A weak Garside group is a group that is equivalent as a category to a Garside groupoid. We show tha…

math.GT2006★ 9 cited

Finite complex reflection arrangements are K(pi,1)

David Bessis

Let be a finite dimensional complex vector space and $W\subseteq \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in of the reflecting hyperpl…

math.GT2004★ 7 cited

Topology of complex reflection arrangements

David Bessis

Let be a finite dimensional complex vector space and $W\subset \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in of the reflecting hyperplan…

math.GR2004★ 10 cited

Non-crossing partitions of type (e,e,r)

David Bessis, Ruth Corran

We investigate a new lattice of generalised non-crossing partitions, constructed using the geometry of the complex reflection group . For the particular case (resp.…

math.GR2004

A dual braid monoid for the free group

David Bessis

We construct a quasi-Garside monoid structure for the free group. This monoid should be thought of as a dual braid monoid for the free group, generalising the constructions by Birm…