Related papers: Basic results on braid groups

In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.

The goal of this paper is to construct examples of centralizers in the Artin braid groups requiring the number of generators quadratic in the number of strings. These examples disprove a recent conjecture of N. Franco and J.…

Brou\'e, Malle and Rouquier conjectured in that the center of the pure braid group of an irreducible finite complex reflection group is cyclic. We prove this conjecture, for the remaining exceptional types, using the analogous result for…

In his proof of the K(pi,1) conjecture for complex reflection arrangements, Bessis defined Garside categories suitable for studying braid groups of centralizers of Springer regular elements in well-generated complex reflection groups. We…

In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard…

This article resolves several long-standing conjectures about Artin groups of euclidean type. In particular, we prove that every irreducible euclidean Artin group is a torsion-free centerless group with a decidable word problem and a…

This article surveys many standard results about the braid group with emphasis on simplifying the usual algebraic proofs. We use van der Waerden's trick to illuminate the Artin-Magnus proof of the classic presentation of the algebraic…

A large class of positive finite presentations of the braid groups is found and studied. It is shown that no presentations but known exceptions in this class have the property that equivalent braid words are also equivalent under positive…

We unify and generalize several approaches to constructing braid group representations from finite groups, using iterated twisted tensor products. Our results hint at a relationship between the braidings on the $G$-gaugings of a pointed…

It is known that the pure braid groups are residually torsion-free nilpotent. This property is however widely open for the most obvious generalizations of these groups, like pure Artin groups and like fundamental groups of hyperplane…

Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…

This thesis takes Brady's construction of $K(\pi,1)$s for the braid groups as a starting point. It is widely known that this construction can - with the right ingredients - be generalized to Artin groups of finite type. Results of Bessis as…

Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…

In a recent paper by L. A. Bokut, V. V. Chaynikov and K. P. Shum in 2007, Braid group $B_n$ is represented by Artin-Burau's relations. For such a representation, it is told that all other compositions can be checked in the same way. In this…

We give presentations of braid groups and pure braid groups on surfaces.

A new presentation of the $n$-string braid group $B_n$ is studied. Using it, a new solution to the word problem in $B_n$ is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes…

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…

In this paper we introduce distinct approaches to loop braid groups, a generalisation of braid groups, and unify all the definitions that have appeared so far in literature, with a complete proof of the equivalence of these definitions.…

We give an algorithm to decide if a given braid is a product of two factors which are conjugates of given powers of standard generators of the braid group. The same problem is solved in a certain class of Garside groups including Artin-Tits…

We show several geometric and algebraic aspects of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the configuration space of necklaces (that we will…