Related papers: Groupes de Garside
The family of $J$-reflection groups can be seen as a combinatorial generalisation of irreducible rank two complex reflection groups and was introduced by the author in a previous article. In this article, we define the braid groups…
We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines…
Starting from the seminal example of the greedy normal norm in braid monoids, we analyse the mechanism of the normal form in a Garside monoid and explain how it extends to the more general framework of Garside families. Extending the…
We give an explicit geometric argument that Artin's braid group $B_n$ is right-orderable. The construction is elementary, natural, and leads to a new, effectively computable, canonical form for braids which we call left-consistent canonical…
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group…
We expound the properties of ribbons in a setting which is general enough to encompass spherical Artin monoids and dual braid monoids of well-generated complex reflection groups. We generalize to our setting results on parabolic subgroups…
We define new presentations for elliptic Artin groups. We also show that the elliptic monoids defined by these presentations are cancellative. This solves the failure of cancellativity for the presentations of elliptic Artin monoids that…
A Garside group is a group admitting a finite lattice generating set D. Using techniques developed by Bestvina for Artin groups of finite type, we construct K(\pi,1)s for Garside groups. This construction shows that the (co)homology of any…
Shephard groups are common extensions of Artin and Coxeter groups. They appear, for example, in algebraic study of manifolds. An infinite family of Shephard groups which are not Artin or Coxeter groups is considered. Using techniques form…
This paper shows how to obtain the key concepts and notations of Garside theory by using the Composition--Diamond lemma. We also show in some cases the greedy normal form is exactly a Gr\"obner--Shirshov normal form and a family of a…
We define geodesic normal forms for the general series of complex reflection groups G(e,e,n). This requires the elaboration of a combinatorial technique in order to explicitly determine minimal word representatives of the elements of…
We study topological full groups attached to groupoid models for left regular representations of Garside categories. Groups arising in this way include Thompson's group $V$ and many of its variations such as R\"over-Nekrashevych groups. Our…
This text consists of the introduction, table of contents, and bibliography of a long manuscript (703 pages) that is currently submitted for publication. This manuscript develops an extension of Garside's approach to braid groups and…
In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal…
In connection with the emerging theory of Garside categories, we develop the notions of a left-Garside category and of a locally left-Garside monoid. In this framework, the connection between the self-distributivity law LD and braids…
Birman, Ko and Lee have introduced a new monoid ${\cal B}^{*}_{n}$--with an explicit presentation--whose group of fractions is the $n$-strand braid group ${\cal B}_{n}$. Building on a new approach by Digne, Michel and himself, Bessis has…
The braid group $B_{n}$, endowed with Artin's presentation, admits two distinguished involutions. One is the anti-automorphism ${\rm{rev}}: B_{n} \to B_{n}$, $v \mapsto \bar{v}$, defined by reading braids in the reverse order (from right to…
We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…
We investigate the relation between the Garside normal form for positive braids and the $2$-braid group defined by Rouquier. Inspired by work of Brav and Thomas we show that the Garside normal form is encoded in the action of the $2$-braid…
In this paper, we give a Groebner-Shirshov basis of the braid group $B_{n+1}$ in the Artin--Garside generators. As results, we obtain a new algorithm for getting the Garside normal form, and a new proof that the braid semigroup $B^+{n+1}$…