Related papers: Conjugacy in Garside Groups III: Periodic braids

This paper is the second in a series in which the authors study the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in Garside groups. The ultra summit set USS(X) of an element X in a Garside group G is a finite set…

We introduce and investigate the ribbon groupoid associated with a Garside group. Under a technical hypothesis, we prove that this category is a Garside groupoid. We decompose this groupoid into a semi-direct product of two of its parabolic…

There exist right angled Artin groups $A$ such that the isomorphism problem for finitely presented subgroups of $A$ is unsolvable, and for certain finitely presented subgroups the conjugacy and membership problems are unsolvable. It follows…

A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…

Our main theorem is that the word problem in the Artin group G = <a,b,c | aba=bab, ac=ca, {}_{n}(b,c) = {}_{n}(c,b) > for n >= 5 can be solved using a system R of length preserving rewrite rules that, together with free reduction, can be…

In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…

In the present paper, we construct a monomorphism from (Artin) pure braid group $PB_{n}$ into a group, which is `bigger' than $PB_{n}$. Roughly speaking, this mapping is defined on words of braids by adding `new generators' between…

This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…

We consider two natural embeddings between Artin groups: the group G_{tilde{A}_{n-1}} of type tilde{A}_{n-1} embeds into the group G_{B_n} of type B_n; G_{B_n} in turn embeds into the classical braid group Br_{n+1}:=G_{A_n} of type A_n. The…

We prove that in the Cayley graph of any braid group modulo its center $B_n/Z(B_n)$, equipped with Garside's generating set, the axes of all pseudo-Anosov braids are strongly contracting. More generally, we consider a Garside group $G$ of…

This article was submitted to a volume under preparation, with Benson Farb as the editor, on the topic of open problems in surface mapping class groups. The braid group B_n is the mapping class group of an n-times punctured disk. The…

This survey was written on the occasion of the course I gave at the Winterbraids XIV workshop in Bordeaux (2025). Its main purpose is to present the techniques that have proven most effective in the study of parabolic subgroups of Artin…

We study topological aspects of supersolvable abelian arrangements, toric arrangements in particular. The complement of such an arrangement sits atop a tower of fiber bundles, and we investigate the relationship between these bundles and…

We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a…

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two…

We study the problem of determining the isomorphism classes of the virtually cyclic subgroups of the n-string braid groups B_n(S^2) of the 2-sphere S^2. If n is odd, or if n is even and sufficiently large, we obtain the complete…

There are recent cryptographic protocols that are based on Multiple Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a method developed by…

We give a quadratic-time explicit and computable algorithm to solve the word problem for Artin groups that do not contain any relations of length 3. Furthermore, we prove that, given two geodesic words representing the same element, one can…

Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four…