It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter type Artin groups. Here we show how to extend the results to more general groups that we call Garside groups. Define a Gaussian monoid to be a finitely generated cancellative monoid where the expressions of a given element have bounded lengths, and where left and right lower common multiples...

The braid group Bn, endowed with Artin’s presentation, admits two distinguished involutions. One is the anti-automorphism rev : Bn → Bn, v 7→ v̄, defined by reading braids in the reverse order (from right to left instead of left to right). Another one is the conjugation τ : x 7→ ∆x∆ by the generalized half-twist (Garside element). More generally, the involution rev is defined for all Artin group...

We develop an analogy between right-angled Artin groups and mapping class groups through the geometry of their actions on the extension graph and the curve graph respectively. The central result in this paper is the fact that each right-angled Artin group acts acylindrically on its extension graph. From this result we are able to develop a Nielsen–Thurston classification for elements in the rig...

We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee [3]. This algorithm can be applied not only to braid groups, but to all Garside groups (which include finite type Artin groups and torus knot groups among others).

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 small cancellation theory we show that the groups in this family are bi-automatic.

In this paper we consider the class of 2–dimensional Artin groups with connected, large type, triangle-free defining graphs (type CLTTF). We classify these groups up to isomorphism, and describe a generating set for the automorphism group of each such Artin group. In the case where the defining graph has no separating edge or vertex we show that the Artin group is not abstractly commensurable t...

In this paper we study the growth rates of Artin monoids and we show that 4 is a universal upper bound. We also show that the generating functions of the associated right-angled Artin monoids are given by families of Chebyshev polynomials. Applications to Artin groups and positive braids are given.

In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system R that satisfies the condition that each rule in R with positive left-hand side has a positive right-hand side, then the monoid presented by the subset of positive rules from R embeds in the group. As an example, ...

In this paper we study topological invariants of a class of random groups. Namely, we study right angled Artin groups associated to random graphs and investigate their Betti numbers, cohomological dimension and topological complexity. The latter is a numerical homotopy invariant reflecting complexity of motion planning algorithms in robotics. We show that the topological complexity of a random ...