Related papers: Noncrossing partitions for periodic braids

Consider an element~$x$ of a Garside group which is rigid in the sense of Garside-theory. Let $SC(x)$ be the set of rigid conjugates of~$x$ -- this is a well-known characteristic subset of the conjugacy class of~$x$. We present…

Let $n\geq 3$. In this paper we deal with the conjugacy problem in the Artin braid group quotient $B_n/[P_n,P_n]$. To solve it we use systems of equations over the integers arising from the action of $B_n/[P_n,P_n]$ over the abelianization…

The group described in this paper appeared while studying fundamental groups of complements of branch curves. It turned out that a certain quotient of the braid group acts on those fundamental groups and studying this action is essential…

We show that for each element $g$ of a Garside group, there exists a positive integer $m$ such that $g^m$ is conjugate to a periodically geodesic element $h$, an element with $|h^n|_\D=|n|\cdot|h|_\D$ for all integers $n$, where $|g|_\D$…

The cycling operation endows the super summit set $S_x$ of any element $x$ of a Garside group $G$ with the structure of a directed graph $\Gamma_x$. We establish that the subset $U_x$ of $S_x$ consisting of the circuits of $\Gamma_x$ can be…

The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…

We prove a conjecture due to Makanin: if a and b are elements of the Artin braid group B_n such that a^k=b^k for some nonzero integer k, then a and b are conjugate. The proof involves the Nielsen-Thurston classification of braids.

We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n $\ge$ 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov…

Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…

Let $D_n$ denote the $n$-punctured disk in the complex plane, where the punctures are on the real axis. An $n$-braid $\alpha$ is said to be \emph{reducible} if there exists an essential curve system $\C$ in $D_n$, called a \emph{reduction…

Let $\Gamma$ be a finite connected graph. The (unlabelled) configuration space $UC^n \Gamma$ of $n$ points on $\Gamma$ is the space of $n$-element subsets of $\Gamma$. The $n$-strand braid group of $\Gamma$, denoted $B_n\Gamma$, is the…

We study braid diagrams with a minimal number of crossings. Such braid diagrams correspond to geodesic words for the braid groups with standard Artin generators. We prove that a diagram of a homogeneous braid is minimal if and only if it is…

In this paper we prove a duality between $k$-noncrossing partitions over $[n]=\{1,...,n\}$ and $k$-noncrossing braids over $[n-1]$. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to…

Let n be greater than or equal to 3. We study the quotient group B\_n/[P n,P\_n] of the Artin braid group B\_n by the commutator subgroup of its pure Artin braid group P\_n. We show that B\_n/[P n,P\_n] is a crystallographic group, and in…

For every finite Coxeter group $\Gamma$, each positive braids in the corresponding braid group admits a unique decomposition as a finite sequence of elements of $\Gamma$, the so-called Garside-normal form.The study of the associated…

On the model of simple braids, defined to be the left divisors of Garside's elements $\Delta\_n$ in the monoid $B\_\infty^+$ , we investigate simple elements in Thompson's monoid $F^+$ and in a larger monoid $H^+$ that is a hybrid of…

We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…

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. This algorithm can be applied not only to braid groups, but to all Garside groups (which include…

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 Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…