Nuno Franco, Juan Gonzalez-Meneses
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).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 …
Positive 3-braids, Khovanov homology and Garside theory
本文利用Garside理论对正3辫共轭类进行分类，并计算其闭包Khovanov同调表的前四列和最低三行，进一步通过共轭最大化下确界以在线性时间内确定更多同调单元。
We show that the span of the variable $q$ in the Lawrence-Krammer-Bigelow representation matrix of a braid is equal to the twice of the dual Garside length of the braid, as was conjectured by Krammer. Our proof is close in spirit to Bigelow's geometric approach. The key observation is that the dual Garside length of a braid can be read off a certain labeling of its curve diagram.
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 decycling operations by a new one, called cyclic sliding, which appears to be a more natural choice. We give an analysis of the complexity of our algorithm in terms of fundamental operations with simple elements, so our analysis is valid for every Garside group. This paper intends to be self-contained, not requiring any previous knowledge of prior algorithms…
Benardete, Gutierrez and Nitecki showed an important result which relates the geometrical properties of a braid, as a homeomorphism of the punctured disk, to its algebraic Garside-theoretical properties. Namely, they showed that if a braid sends a curve to another curve, then the image of this curve after each factor of the left normal form of the braid (with the classical Garside structure) is also standard. We provide a new simple, geometric proof of the result by Benardete-Gutierrez-Nitecki, which can be easily adapted to the case of the dual Garside structure of braid groups, with the appr…
Several distinct Garside monoids having torus knot groups as groups of fractions are known. For $n,m\geq 2$ two coprime integers, we introduce a new Garside monoid $\mathcal{M}(n,m)$ having as Garside group the $(n,m)$-torus knot group, thereby generalizing to all torus knot groups a construction that we previously gave for the $(n,n+1)$-torus knot group. As a byproduct, we obtain new Garside structures for the braid groups of a few exceptional complex reflection groups of rank two. Analogous Garside structures are also constructed for a few additional braid groups of exceptional complex refle…
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…
Quasipositive Braids, Presentations, and Garside Structures
本文给出辫子群的一种特定表示，证明其正幺半群不与拟正辫子幺半群同构，且拟正辫子幺半群无真Garside族，解决了Calegari的一个问题。
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-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…
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.
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 …
In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. Then we study how a cyclic sliding (which is a particular kind of conjugation) affects the normal form of a braid with respect to the normal forms of its components. Finally, using the above methods, we provide the example of a family of braids whose sets of sliding circuits (hence ultra summit sets) have exponential size with respect to the number of strands and also with res…
From a group $H$ and a non-trivial element $h$ of $H$, we define a representation $ρ: B_n \to \Aut(G)$, where $B_n$ denotes the braid group on $n$ strands, and $G$ denotes the free product of $n$ copies of $H$. Such a representation shall be called the Artin type representation associated to the pair $(H,h)$. The goal of the present paper is to study different aspects of these representations. Firstly, we associate to each braid $β$ a group $Γ_{(H,h)} (β)$ and prove that the operator $Γ_{(H,h)}$ determines a group invariant of oriented links. We then give a topological construction of the Arti…
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 of elements in G, introduced by the second author, which is a complete invariant of the conjugacy class of X in G. A fundamental question, if one wishes to find bounds on the size of USS(X), is to understand its structure. In this paper we introduce two new operations on elements of USS(X), called `partial cycling' and `partial twisted decycling', and prove …
We describe how an Ore category with a Garside family can be used to construct a classifying space for its fundamental group(s). The construction simultaneously generalizes Brady's classifying space for braid groups and the Stein--Farley complexes used for various relatives of Thompson's groups. It recovers the fact that Garside groups have finite classifying spaces. We describe the categories and Garside structures underlying certain Thompson groups. The Zappa--Szép product of categories is introduced and used to construct new categories and groups from known ones. As an illustration of our m…
The Garside group, as a generalization of braid groups and Artin groups of finite types, is defined as the group of fractions of a Garside monoid. We show that the semidirect product of Garside monoids is a Garside monoid. We use the semidirect product $\mathbb Z\ltimes G^n$ of the infinite cyclic group $\mathbb Z$ and the cartesian product $G^n$ of a Garside group $G$ to study the properties of roots and powers of elements in $G$. The main result is an estimate of the growth of the minimal word-length of powers of elements in Garside groups, when the generating set is the set of simple elemen…
When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the traditional Garside structure of the braid group and plays a major role in Krammer's algebraic proof. The q variable, associated with the dual Garside structure of the braid group, has received less attention. In this article we give a geometric interpretation of the q portion of the LKB representation in terms of an action of the braid group on the space of non-dege…
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…
Parabolic subgroups of complex braid groups: the remaining case
本文利用复辫子群 B(G31) 的 Garside 广群结构，证明 Marin 和 González-Meneses 关于抛物子群的主要定理，补全了此前唯一遗留情形。
In this work we present a natural surjective map from rigid braids in B_3 (in Garside sense) to SL_2(N). This map provides an upper and a lower bound for the dilatation factor of a pseudo-Anosov 3-strand braid. These bounds only depend on the canonical length of the classical Garside structure of B_3.
A graph is Helly if every family of pairwise intersecting combinatorial balls has a nonempty intersection. We show that weak Garside groups of finite type and FC-type Artin groups are Helly, that is, they act geometrically on Helly graphs. In particular, such groups act geometrically on spaces with convex geodesic bicombing, equipping them with a nonpositive-curvature-like structure. That structure has many properties of a CAT(0) structure and, additionally, it has a combinatorial flavor implying biautomaticity. As immediate consequences we obtain new results for FC-type Artin groups (in parti…
Morse elements in Garside groups are strongly contracting
本文证明在具有循环中心的有限型 Garside 群模中心的 Cayley 图中，任意 Morse 元素的轴是强压缩的，并推论得出 Morse 元素在附加长度图上以斜驶方式作用。
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, simplifying the algorithms concerning conjugacy in Garside groups and having nicer theoretical properties. We show, in particular, that if a super summit element has conjugates which are 'rigid' (that is, which have a certain particularly simple structure), then the optimal way of obtaining such a rigid conjugate through conjugation by positive elements is given by it…
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 provides a context in which various definitions and arguments concerning Garside groups are unified and simplified as well as improved. Practically, it yields a new algorithm which has a considerably improved performance on solving the conjugacy problem of reducible braids.
The Hilden Double Coset Problem in Braid Groups
本文解决了辫群模Hilden子群的双陪集问题，证明平结闭包的链环问题稳定等价于可解代数问题，并利用Garside分解方法。
Let $G$ be a Garside group with Garside element $Δ$, and let $Δ^m$ be the minimal positive central power of $Δ$. An element $g\in G$ is said to be 'periodic' if some power of it is a power of $Δ$. In this paper, we study periodic elements in Garside groups and their conjugacy classes. We show that the periodicity of an element does not depend on the choice of a particular Garside structure if and only if the center of $G$ is cyclic; if $g^k=Δ^{ka}$ for some nonzero integer $k$, then $g$ is conjugate to $Δ^a$; every finite subgroup of the quotient group $G/<Δ^m>$ is cyclic. By a classical theor…
Let $D_n$ denote the $n$-punctured disk in the complex plane, where the punctures are on the real axis. An $n$-braid $α$ is said to be \emph{reducible} if there exists an essential curve system $\C$ in $D_n$, called a \emph{reduction system} of $α$, such that $α*\C=\C$ where $α*\C$ denotes the action of the braid $α$ on the curve system $\C$. A curve system $\C$ in $D_n$ is said to be \emph{standard} if each of its components is isotopic to a round circle centered at the real axis. In this paper, we study the characteristics of the braids sending a curve system to a standard curve system, and …
We show that there is a family of pseudo-Anosov braids independently parameterized by the braid index and the (canonical) length whose smallest conjugacy invariant sets grow exponentially in the braid index and linearly in the length and conclude that the conjugacy problem remains exponential in the braid index under the current knowledge.
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 the author and Nuno Franco, originally intended to solve the Conjugacy Search Problem in braid groups.
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.
Garside's results and the existense of the greedy normal form for braids are shown to be true for the singular braid monoid. An analogue of the presentation of J. S. Birman, K. H. Ko and S. J. Lee for the braid group is also obtained for this monoid.
This article is a survey on the braid groups, the Artin groups, and the Garside groups. It is a presentation, accessible to non-experts, of various topological and algebraic aspects of these groups. It is also a report on three points of the theory: the faithful linear representations, the cohomology, and the geometrical representations.
We prove that the Garside length a braid is equal to a winding-number type invariant of the curve diagram of the braid.
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 conjugacy problem that is successful for random braids in overwhelming probability. As either the braid index or the number of permutation-braid factors increases, the success probability converges to 1 and so, contrary to the common belief, the distribution of hard instances for the conjugacy problem is getting sparser. We also prove a conjecture by Birman a…
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.
In this article we describe the summit sets in B_3, the smallest element in a summit set and we compute the Hilbert series corresponding to conjugacy classes.The results will be related to Birman-Menesco classification of knots with braid index three or less than three.
New Garside structures and applications to Artin groups
提出一种将群与 $\mathbb{Z}$ 的直积转化为 Garside 群的方法，生成包含小消去群和 Artin 群的新实例，并证明了双曲型 Artin 群的 $K(π,1)$-猜想新情形。
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 of the pure Artin braid group $P_n/[P_n,P_n]$. Using this technique we also realize explicitly infinite virtually cyclic subgroups in $B_n/[P_n,P_n]$.
We prove that an Artin-Tits group of type $\tilde C$ is the group of fractions of a Garside monoid, analogous to the known dual monoids associated with Artin-Tits groups of spherical type and obtained by the "generated group" method. This answers, in this particular case, a general question on Artin-Tits groups, gives a new presentation of an Artin-Tits group of type $\tilde C$, and has consequences for the word problem, the computation of some centralizers or the triviality of the center. A key point of the proof is to show that this group is a group of fixed points in an Artin-Tits group of …
An embedding of the m-times punctured disc into the n-times punctured disc, for n>m, yields an embedding of the braid group on m strands B_m into the braid group on n strands B_n, called a geometric embedding. The main example consists of adding n-m trivial strands to the right of each braid on m strands. We show that geometric embeddings do not merge conjugacy classes, meaning that if the images of two elements in B_m by a geometric embedding are conjugate in B_n, the original elements are conjugate in B_m. We also show that the result does not hold, in general, for geometric embeddings of ma…
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.
We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a reduction system of circles can be found completely if the input is a certain type of reducible braids.
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…
Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to the inverse braid monoids. Namely we prove an inclusion into a monoid of partial monomorphisms of a free group. This gives a solution of the word problem. Another solution is obtained by an approach similar to that of Garside. We give also the analogues of Artin presentation with two generators and Sergiescu graph-presentations.
We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the Artin monoid.
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…
Faithful Burau-like representations of some rank two Garside groups and torus knot groups
本文提出一种方法，用于生成G(n,m)群在GL₂(C[t±¹, q±¹])中的忠实表示，其中G(n,m)是Garside群，其元素的Garside正规形式可通过矩阵显式恢复。该方法构造了多个忠实表示，包括推广到G(n,m)类群的Burau表示，这些群是扭结群。
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…
We prove that the exponential growth rate of the regular language of penetration sequences is smaller than the growth rate of the regular language of normal form words, if the acceptor of the regular language of normal form words is strongly connected. Moreover, we show that the latter property is satisfied for all irreducible Artin monoids of spherical type, extending a result by Caruso. Our results establish that the expected value of the penetration distance $pd(x,y)$ in an irreducible Artin monoid of spherical type is bounded independently of the length of $x$, if $x$ is chosen uniformly a…
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 …
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.
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.
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.
The braid group $B_{n}$, endowed with Artin's presentation, admits two distinguished involutions. One is the anti-automorphism ${\rm{rev}}: B_{n} \to B_{n}$, $v \mapsto \bar{v}$, defined by reading braids in the reverse order (from right to left instead of left to right). Another one is the conjugation $τ:x \mapsto Δ^{-1}x Δ$ by the generalized half-twist (Garside element). More generally, the involution ${\rm{rev}}$ is defined for all Artin groups (equipped with Artin's presentation) and the involution $τ$ is defined for all Artin groups of finite type. A palindrome is an element invariant un…
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…
This article is about Artin's braid group and its role in knot theory. We set ourselves two goals: (i) to provide enough of the essential background so that our review would be accessible to graduate students, and (ii) to focus on those parts of the subject in which major progress was made, or interesting new proofs of known results were discovered, during the past 20 years. A central theme that we try to develop is to show ways in which structure first discovered in the braid groups generalizes to structure in Garside groups, Artin groups and surface mapping class groups. However, the literat…
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…
We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $Δ\_{ij}$, which are Garside-like half-twists involving strings $i$ through $j$, and by counting powered generators $Δ\_{ij}^k$ as $\log(|k|+1)$ instead of simply $|k|$. The geometrical complexity is some natural measure of the amount of distortion of the $n$ times punctured disk caused by a homeomorphism. Our main result is that the two notions of complexity are comparabl…
We study the rational permutation braids, that is the elements of an Artin-Tits group of spherical type which can be written $x^{-1} y$ where $x$ and $y$ are prefixes of the Garside element of the braid monoid. We give a geometric characterization of these braids in type $A_n$ and $B_n$ and then show that in spherical types different from $D_n$ the simple elements of the dual braid monoid (for arbitrary choice of Coxeter element) embedded in the braid group are rational permutation braids (we conjecture this to hold also in type $D_n$).This property implies positivity properties of the polynom…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。