The n-th root of a braid is unique up to conjugacy

Twisted conjugacy classes in Symplectic groups, Mapping class groups and Braid groups(including an Appendix written with Francois Dahmani)

We prove that the symplectic group $Sp(2n,\mathbb Z)$ and the mapping class group $Mod_{S}$ of a compact surface $S$ satisfy the $R_{\infty}$ property. We also show that $B_n(S)$, the full braid group on $n$-strings of a surface $S$, satisfies the $R_{\infty}$ property in the cases where $S$ is either the compact disk $D$, or the sphere $S^2$. This means that for any automorphism $ϕ$ of $G$, where $G$ is one of the above groups, the number of twisted $ϕ$-conjugacy classes is infinite.

Conjugacy in Garside Groups III: Periodic braids

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 braid index n for the special case of periodic braids. We overcome this difficulty by putting to work several known isomorphisms between Garside structures in the braid group B_n and other Garside groups. This allows us to obtain a polynomial solution to the original problem in the spirit of the previously known algorithms. This paper is the third in a series…

Conjugacy problem for braid groups and Garside groups

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 finite type Artin groups and torus knot groups among others).

Conjugacy classes of periodic braids

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 as the super summit set and the ultra summit set. Their complexities are proportional to the size of the finite set, even when there exist very short conjugating elements. However, ultra summit sets are very large in some cases especially for reducible braids and periodic braids. Some possible approaches to resolve this difficulty would be either to use dif…

The infimum, supremum and geodesic length of a braid conjugacy class

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which was left unsolved in both papers was the number m of times one must `cycle' (resp. `decycle') in order to increase inf (resp. decrease sup) or to be sure that it is already maximal (resp. minimal) for the given conjugacy class. Our main result is to prove that m is bounded above by n-2 in the situation of the second algorithm and by ((n^2-n)/2)-1 in the situ…

Conjugacy for positive permutation braids

Positive permutation braids on n strings, which are defined to be positive n-braids where each pair of strings crosses at most once, form the elementary but non-trivial building blocks in many studies of conjugacy in the braid groups. We consider conjugacy among these elementary braids which close to knots, and show that those which close to the trivial knot or to the trefoil are all conjugate. All such n-braids with the maximum possible crossing number are also shown to be conjugate. We note that conjugacy of these braids for n<6 depends only on the crossing number. In contrast, we exhibit tw…

The classification and the conjugacy classes of the finite subgroups of the sphere braid groups

Let n\geq 3. We classify the finite groups which are realised as subgroups of the sphere braid group B_n(S^2). Such groups must be of cohomological period 2 or 4. Depending on the value of n, we show that the following are the maximal finite subgroups of B_n(S^2): Z_{2(n-1)}; the dicyclic groups of order 4n and 4(n-2); the binary tetrahedral group T_1; the binary octahedral group O_1; and the binary icosahedral group I. We give geometric as well as some explicit algebraic constructions of these groups in B_n(S^2), and determine the number of conjugacy classes of such finite subgroups. We also …

Reduce Problems From Braid Groups To Braid Monoids

This paper proposes for every $n$, linear time reductions of the word and conjugacy problems on the braid groups $B_n$ to the corresponding problems on the braid monoids $B_n^+$ and moreover only using positive words representations.

A new approach to the word and conjugacy problems in the braid groups

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 possible certain computational improvements. We also give a related solution to the conjugacy problem, but the improvements in its complexity are not clear at this writing.

Conjugacy in Garside groups I: Cyclings, powers, and rigidity

In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal form changes only in the obvious way under cycling and decycling. It is also shown that, given X in a Garside group, if some power X^m is conjugate to a rigid element, then m can be bounded above by ||Δ||^3. In the particular case of braid groups, this implies that a pseudo-Anosov braid has a small power whose ultra summit set consists of rigid elements. This s…

Garside theory and subsurfaces: some examples in braid groups

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 braids with a fixed number of strands, the size of this set is bounded by a polynomial in the length of the braids. In this paper we suggest a more precise bound: for rigid braids with $N$ strands and of Garside length $L$, the sliding circuit set should have at most $C\cdot L^{N-2}$ elements, for some constant $C$. We construct a family of braids which realise t…

Reducible braids and Garside theory

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 conjugacy class which we call the stabilized set of sliding circuits, and if it is reducible, then its reducibility is geometrically obvious: it has a round or almost round reducing curve. Moreover, for any given braid, an element of its stabilized set of sliding circuits can be found using the well-known cyclic sliding operation. This leads to a polynomial …

On the cycling operation in braid groups

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 their seminal paper on braid-cryptography, Ko, Lee et al. proposed the {\it cycling problem} as a hard problem in braid groups that could be interesting for cryptography. In this paper we give a polynomial solution to that problem, mainly by showing that cycling is surjective, and using a result by Maffre which shows that pre-images under cycling can be computed…

Small braids having a big Ultra Summit Set

In [J.Birman, V.Gebhardt, J.Gonzalez-Meneses, Conjugacy in Garside groups I: cyclings, powers and rigidity] authors asked: (open question 2) is the size of USS of a rigid pseudo-Anosov braid is bounded above by some polynomial in the number of strands and the braid length? We answer this question in the negative.

Identifying Powers of Half-Twists and Computing its Root

In this paper we give an algorithm for solving a main case of the conjugacy problem in the braid groups. We also prove that half-twists satisfy a special root property which allows us to reduce the solution for the conjugacy problem in half-twists into the free group. Using this algorithm one is able to check conjugacy of a given braid to one of E. Artin's generators in any power, and compute its root. Moreover, the braid element which conjugates a given half-twist to one of E. Artin's generators in any power can be restored. The result is applicable to calculations of braid monodromy of branc…

Algorithmic Problems in the Braid Group

We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the generalized word problem in braid groups, in the special case of cyclic subgroups. We illustrate this solution and its complexity using a multitape Turing machine. We then turn to a discussion of decision problems in cyclic amalgamations of groups. Again using a multitape Turing machine, we solve the word problem for the cyclic amalgamation of two braid groups. We an…

Quasi-positivity and recognition of products of conjugacy classes in free groups

Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups, where it has been shown that the closure of quasi-positive braids coincides with the geometrically defined class of $\mathbb{C}$-transverse links. We describe an algorithm that recognizes whether or not an element of a free group is quasi-positive with respect to a basis. Spherical cancellation diagrams over free groups are used to establish the validity of th…

Uniqueness of roots up to conjugacy for some affine and finite type Artin groups

Let $G$ be one of the Artin groups of finite type ${\mathbf B}_n={\mathbf C}_n$, and affine type $\tilde{\mathbf A}_{n-1}$ and $\tilde{\mathbf C}_{n-1}$. In this paper, we show that if $α$ and $β$ are elements of $G$ such that $α^k=β^k$ for some nonzero integer $k$, then $α$ and $β$ are conjugate in $G$. For the Artin group of type $\mathbf A_n$, this was recently proved by J. González-Meneses. In fact, we prove a stronger theorem, from which the above result follows easily by using descriptions of those Artin groups as subgroups of the braid group on $n+1$ strands. Let $P$ be a subset of $\{1…

On braided, banded surfaces and ribbon obstructions

We discuss how to apply work of L. Rudolph to braid conjugacy class invariants to obtain potentially effective obstructions to a slice knot being ribbon. We then apply these ideas to a family of braid conjugacy class invariants coming from Khovanov-Lee theory and explain why we do not obtain effective ribbon obstructions in this case.

About presentations of braid groups and their generalizations

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 Artin presentation for generalizations of braids. Namely, we consider presentations with small number of generators, Sergiescu graph-presentations and Birman-Ko-Lee presentation. The work of V.V.Chaynikov on the word and conjugacy problems for the singular braid monoid in Birman-Ko-Lee generators is described as well.

On roots of Dehn twists

Margalit and Schleimer constructed nontrivial roots of the Dehn twist about a nonseparating curve. We prove that the conjugacy classes of roots of the Dehn twist about a nonseparating curve correspond to the conjugacy classes of periodic maps with certain conditions. Futhermore, we give data set which determine the conjugacy class of a root. As a consequence, we can find the minimum degree and the maximum degree, and show that the degree must be odd. Also, we give Dehn twist expression of the root of degree 3.

The conjugacy problem in right-angled Artin groups and their subgroups

We prove that the conjugacy problem in right-angled Artin groups (RAAGs), as well as in a large and natural class of subgroups of RAAGs, can be solved in linear-time. This class of subgroups contains, for instance, all graph braid groups (i.e. fundamental groups of configuration spaces of points in graphs), many hyperbolic groups, and it coincides with the class of fundamental groups of ``special cube complexes'' studied independently by Haglund and Wise.

A New Approach to the Conjugacy Problem in Garside Groups

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 $Γ_x$. We establish that the subset $U_x$ of $S_x$ consisting of the circuits of $Γ_x$ can be used instead of $S_x$ for deciding conjugacy to $x$ in $G$, yielding a faster and more practical solution to the conjugacy problem for Garside groups. Moreover, we present a probabilistic approach to the conjugacy search problem in Garside groups. The results are likely to have implications for the security of recently proposed cryptosystems based on the hardness of …

The density of Lawrence-Krammer and non-conjugate braid representations of links

We use some Lie group theory and Budney's unitarization of the Lawrence-Krammer representation, to prove that for generic parameters of definite form the image of the representation (also on certain types of subgroups) is dense in the unitary group. This implies that, except possibly for closures of full-twist braids, all links have infinitely many conjugacy classes of braid representations on any non-minimal number of (and at least 4) strands.

Categorified invariants and the braid group

We investigate two "categorified" braid conjugacy class invariants, one coming from Khovanov homology and the other from Heegaard Floer homology. We prove that each yields a solution to the word problem but not the conjugacy problem in the braid group.

Secondary Braid Groups

We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $σ_1,\dots,σ_{n-1}$. Our study addresses invariance properties of these presentations and the presented groups under various operations on the words. In particular we prove that the group does only depend on the corresponding element in the positive braid monoid, and under mild hypotheses only on its conjugacy class in the braid group.

Agol cycles of pseudo-Anosov 3-braids

An Agol cycle is a complete invariant of the conjugacy class of a pseudo-Anosov mapping class. We study necessary and sufficient conditions for equivalent Agol cycles of pseudo-Anosov 3-braids.

Quotients of the Artin braid groups and crystallographic groups

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 the case n=3, we analyse explicitly some of its subgroups. We also prove that B\_n/[P n,P\_n] possesses torsion, and we show that there is a one-to-one correspondence between the conjugacy classes of the finite-order elements of B\_n/[P n,P\_n] with the conjugacy classes of the elements of odd order of the symmetric group S\_n, and that the isomorphism class …

Exchange moves and braid representations of links

We prove that under fairly general conditions an iterated exchange move gives infinitely many non-conjugate braids. As a consequence, every knot has infinitely many conjugacy classes of n-braid representations if and only if it has one admitting an exchange move.

Braids, their properties and generalizations

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 braid group and the Markov normal form are given next. Garside normal form and his solution of the conjugacy problem are presented as well as more recent results on the ordering and on the linearity of braid groups. Next topics are the generalizations of braids, their homological properties and connections with the other mathematical fields, like knot theory (v…

Computation of Centralizers in Braid groups and Garside Groups

We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.

Basic results on braid groups

These are Lecture Notes of a course given by the author at the French-Spanish School "Tresses in Pau", held in Pau (France) in October 2009. It is basically an introduction to distinct approaches and techniques that can be used to show results in braid groups. Using these techniques we provide several proofs of well known results in braid groups, namely the correctness of Artin's presentation, that the braid group is torsion free, or that its center is generated by the full twist. We also recall some solutions of the word and conjugacy problems, and that roots of a braid are always conjugate. …

Braids, Conformal Module and Entropy

The conformal module of conjugacy classes of braids implicitly appeared in a paper of Lin and Gorin in connection with their interest in the 13. Hilbert Problem. This invariant is the supremum of conformal modules (in the sense of Ahlfors) of certain annuli related to the conjugacy class. This note states that the conformal module is inverse proportional to a popular dynamical braid invariant, the entropy. The entropy appeared in connection with Thurston's theory of surface homeomorphisms. An application of the concept of conformal module to algebraic geometry is given.

Injectivity on the set of conjugacy classes of some monomorphisms between Artin groups

There are well-known monomorphisms between the Artin groups of finite type $\arA_n$, $\arB_n=\arC_n$ and affine type $\tilde \arA_{n-1}$, $\tilde\arC_{n-1}$. The Artin group $A(\arA_n)$ is isomorphic to the $(n+1)$-strand braid group $B_{n+1}$, and the other three Artin groups are isomorphic to some subgroups of $B_{n+1}$. The inclusions between these subgroups yield monomorphisms $A(\arB_n)\to A(\arA_n)$, $A(\tilde \arA_{n-1})\to A(\arB_n)$ and $A(\tilde \arC_{n-1})\to A(\arB_n)$. There are another type of monomorphisms $A(\arB_d)\to A(\arA_{md-1})$, $A(\arB_d)\to A(\arB_{md})$ and $A(\arB_d)…

辫群中的Hilden双陪集问题

The Hilden Double Coset Problem in Braid Groups

本文解决了辫群模Hilden子群的双陪集问题，证明平结闭包的链环问题稳定等价于可解代数问题，并利用Garside分解方法。

Anti-trees and right-angled Artin subgroups of braid groups

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure braid group and into the area-preserving diffeomorphism groups of the 2--disk and the 2--sphere, answering questions due to Crisp--Wiest and M. Kapovich. Another corollary is that a pure braid group contains a closed hyperbolic manifold group as a quasi-isometrically embedded subgroup up to dimension eight. Finally, we show that the isomorphism problem, conj…

Towards an implementation of the B-H algorithm for recognizing the unknot

In their paper `A new algorithm for recognizing the unknot', in Geometry and Topology', 2 (1998) n. 9, 175-220, the first author and Michael Hirsch presented a then new algorithm for recognizing the unknot. The first part of the algorithm required the systematic enumeration of all discs which support a `braid foliation' and are embeddable in 3-space. The boundaries of these `foliated embeddable discs' (FED's) are the collection of all closed braid representatives of the unknot, up to conjugacy, and the second part of the algorithm produces a word in the generators of the braid group which repr…

On the genericity of pseudo-Anosov braids II: conjugations to rigid 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 braids in the ball of radius l tends to 1 exponentially quickly as l tends to infinity. Moreover, with a similar notion of genericity, we prove that for generic pairs of elements of the braid group, the conjugacy search problem can be solved in quadratic time. The idea behind both results is that generic braids can be conjugated "easily" into a rigid braid.

Roots, symmetries and conjugacy of pseudo-Anosov mapping classes

An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and in this case compute the roots. The second problem is the symmetry problem: decide if the element commutes with a finite order element and in this case compute this element. The structure theorem on which this algorithm is based provides also a new solution to the conjugacy problem.

Crystallographic groups and flat manifolds from surface braid groups

Let $M$ be a compact surface without boundary, and $n\geq 2$. We analyse the quotient group $B_n(M)/Γ_2(P_n(M))$ of the surface braid group $B_{n}(M)$ by the commutator subgroup $Γ_2(P_n(M))$ of the pure braid group $P_{n}(M)$. If $M$ is different from the $2$-sphere $\mathbb{S}^2$, we prove that $B_n(M)/Γ_2(P_n(M))$ is isomorphic rho $P_n(M)/Γ_2(P_n(M)) \rtimes_φ S_n$, and that $B_n(M)/Γ_2(P_n(M))$ is a crystallographic group if and only if $M$ is orientable. If $M$ is orientable, we prove a number of results regarding the structure of $B_n(M)/Γ_2(P_n(M))$. We characterise the finite-order el…

The braid group $B_3$ in the framework of continued fractions

We use the classical interpretation of the braid group $B_3$ as a central extension of the modular group $\text{PSL}_2\left(\mathbb{Z}\right)$ to establish new and fundamental properties of $B_3$ using the theory of continued fractions. In particular, we give simple and natural linear time algorithms to solve the word and conjugacy problems in $B_3$. The algorithms introduced in this paper are easy to implement and are the most efficient algorithms in the literature to solve these problems in the braid group $B_3$.

An asymptotic behavior of the dilatation for a family of pseudo-Anosov braids

The dilatation of a pseudo-Anosov braid is a conjugacy invariant. In this paper, we study the dilatation of a special family of pseudo-Anosov braids. We prove an inductive formula to compute their dilatation, a monotonicity and an asymptotic behavior of the dilatation for this family of braids. We also give an example of a family of pseudo-Anosov braids with arbitrarily small dilatation such that the mapping torus obtained from such braid has 2 cusps and has an arbitrarily large volume.

椭圆纤维化的辫子单项群中的挠元

Torsion in the Braid Monodromy of Elliptic Fibrations

本文研究了椭圆纤维化的辫子单项群，通过将其共轭类与$\operatorname{SL}_2$-特征簇上的特殊点相联系，分类了其中的 $n$ 阶元素，并证明了该群中不存在 $n-1$ 或 $n-2$ 阶元素。

Probabilistic Solutions of Equations in the Braid Group

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability. Moreover, with a significant probability, the solution will be the first in the list. This gives a probabilistic solution to: The conjugacy problem, the group membership problem, the shortest representation of an element, and other combinatorial group-theoretic problems in random subgroups of the braid group. We use a memory-based extension of the standard length…

超椭圆对合的根与映射类群中模去中心的辫子群

Roots of hyperelliptic involutions and braid groups modulo their center inside mapping class groups

本文在亏格为nk的闭曲面映射类群中构造了模去中心的辫子群副本，将半扭辫子类与超椭圆对合等同，从而证明超椭圆对合具有无穷多个平方根和立方根，并讨论其共轭类。

虚拟辫子群、虚拟孪生群与晶体群

Virtual braid groups, virtual twin groups and crystallographic groups

本文证明虚拟辫子群与虚拟孪生群模去对应纯群换位子群后的商为晶体群，刻画其有限阶元素与共轭类，并实现 Bieberbach 群及无限虚拟循环群。

A journey through loop braid groups

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. These groups have in fact been an object of interest in different domains of mathematics and mathematical physics, and have been called, in addition to loop braid groups, with several names such as of motion groups, groups of permutation-conjugacy automorphisms, braid-permutation groups, welded braid groups and untwisted ring groups. In parallel to this, we int…

随机正3辫子的Alexander多项式根

Roots of Alexander polynomials of random positive 3-braids

本文研究随机正3股辫子闭合的纽结和链环的Alexander多项式根的分布，提出精确猜想并证明至少69%的根位于单位圆上、原点附近存在无根区域，还引入Burau表示的Lyapunov指数和分岔测度研究根的等分布，并证明符号差函数的中心极限定理。

Almost-crystallographic groups as quotients of Artin braid groups

Let $n, k \geq 3$. In this paper, we analyse the quotient group $B\_n/Γ\_k(P\_n)$ of the Artin braid group $B\_n$ by the subgroup $Γ\_k(P\_n)$ belonging to the lower central series of the Artin pure braid group $P\_n$. We prove that it is an almost-crystallographic group. We then focus more specifically on the case $k=3$. If $n \geq 5$, and if $τ\in N$ is such that $gcd(τ, 6) = 1$, we show that $B\_n/Γ\_3 (P\_n)$ possesses torsion $τ$ if and only if $S\_n$ does, and we prove that there is a one-to-one correspondence between the conjugacy classes of elements of order $τ$ in $B\_n/Γ\_3 (P\_n)$ w…

Word and Conjugacy Problems in Groups $G_{k+1}^{k}$

Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems led to the discovery of the following fundamental principle: `If dynamical systems describing the motion of $n$ particles possess a nice codimension one property governed by exactly $k$ particles, then these dynamical systems admit a topological invariant valued in $G_{n}^{k}$'. The $G_n^k$ groups have connections to different algebraic structures, Coxeter gr…

基本群、3-辫群与不变量的有效估计

Fundamental Groups, 3-Braids, and Effective Estimates of Invariants

本研究定义辫群不变量，通过纯3-辫的自然音节分解给出其不变量及熵的有效上下界（界间差为不依赖字的乘法常数），并推广至所有3-辫，证明涉及双穿孔复平面基本群曲线的极值长度研究。

Honors Thesis: On the faithfulness of the Burau representation at roots of unity

We study the kernel of the evaluated Burau representation through the braid element $σ_i σ_{i+1} σ_i$. The element is significant as a part of the standard braid relation. We establish the form of this element's image raised to the $n^{th}$ power. Interestingly, the cyclotomic polynomials arise and can be used to define the expression. The main result of this paper is that the Burau representation of the braid group of $n$ strands for $n \geq 3$ is unfaithful at any primitive root of unity, excepting the first three.

Noncrossing partitions for periodic braids

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 $α$ in the super summit set of $ε^d$, find $γ\in B_n$ such that $γ^{-1}αγ=ε^d$, where $ε=(σ_{n-1}\cdotsσ_1)σ_1$. In this article we characterize the elements in the super summit set of $ε^d$ in the dual Garside structure by studying the combinatorics of noncrossing partitions arising from periodic braids. Our characterization directly provides a conjugating …

On Burau representations at roots of unity

We consider subgroups of the braid groups which are generated by $k$-th powers of the standard generators and prove that any infinite intersection (with even $k$) is trivial. This is motivated by some conjectures of Squier concerning the kernels of Burau's representations of the braid groups at roots of unity. Furthermore, we show that the image of the braid group on 3 strands by these representations is either a finite group, for a few roots of unity, or a finite extension of a triangle group, by using geometric methods.