相关论文: Length-based conjugacy search in the Braid group

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…

We give a method to produce representations of the braid group $B_n$ of $n-1$ generators ($n\leq \infty$). Moreover, we give sufficient conditions over a non unitary representation for being of this type. This method produces examples of…

We show that Lawrence's representation and linear representations from quantum sl_2 called generic highest weight vectors detect the dual Garside length of braids in a simple and natural way. That is, by expressing a representation as a…

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…

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

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…

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…

A very popular problem on braid groups has recently been solved by Bigelow and Krammer, namely, they have found a faithful linear representation for the braid group B_n. In their papers, Bigelow and Krammer suggested that their…

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…

We construct new non-associative key establishment protocols for all left self-distributive (LD), multi-LD-, and mutual LD-systems. The hardness of these protocols relies on variations of the (simultaneous) iterated LD-problem and its…

Inspired by the classical fractional cascading technique, we introduce new techniques to speed up the following type of iterated search in 3D: The input is a graph $\mathbf{G}$ with bounded degree together with a set $H_v$ of 3D hyperplanes…

Let $n$ be a positive integer and let $G$ be a group. We denote by $\nu(G)$ a certain extension of the non-abelian tensor square $G \otimes G$ by $G \times G$. Set $T_{\otimes}(G) = \{g \otimes h \mid g,h \in G\}$. We prove that if the size…

Let N be a finitely generated normal subgroup of a Gromov hyperbolic group G. We establish criteria for N to have solvable conjugacy problem and be conjugacy separable in terms of the corresponding properties of G/N. We show that the…

We investigate the conjugacy growth of finitely generated linear groups. We show that finitely generated non-virtually-solvable subgroups of GL_d have uniform exponential conjugacy growth and in fact that the number of distinct polynomials…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

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…

We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is…

This work presents an approach towards the representation theory of the braid groups $B_n$. We focus on finite-dimensional representations over the field of Laurent series which can be obtained from representations of infinitesimal braids,…

The conjugator length function of a finitely generated group is the function $f$ so that $f(n)$ is the minimal upper bound on the length of a word realizing the conjugacy of two words of length at most $n$. We study herein the spectrum of…

We survey and compare various generalizations of braid groups for quivers with superpotential and focus on the cluster braid groups, which are introduced in a joint work with A.~King. Our motivations come from the study of cluster algebras,…