Related papers: Conjugacy in Garside groups I: Cyclings, powers, a…
We present a new operation to be performed on elements in a Garside group, called cyclic sliding, which is introduced to replace the well known cycling and decycling operations. Cyclic sliding appears to be a more natural choice,…
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…
Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…
Let $G$ be a Garside group with Garside element $\Delta$, and let $\Delta^m$ be the minimal positive central power of $\Delta$. An element $g\in G$ is said to be 'periodic' if some power of it is a power of $\Delta$. In this paper, we study…
An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…
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…
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…
We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and…
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 cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…
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…
Recently, there have been several progresses for the conjugacy search problem (CSP) in Garside groups, especially in braid groups. All known algorithms for solving this problem use a sort of exhaustive search in a particular finite set such…
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
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…
An element in Artin's braid group $B_n$ is called periodic if it has a power which lies in the center of $B_n$. The conjugacy problem for periodic braids can be reduced to the following: given a divisor $1\le d<n-1$ of $n-1$ and an element…
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$…
In this article, we introduce the notion of cycling operations of arbitrary order in Garside groups, which is a full generalization of the cycling and decycling operations. Theoretically, this notion together with other related concepts…
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 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…
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…