Related papers: Conjugacy classes of positive $3$-braids

Conjugacy is not the only possible primitive for designing braid-based protocols. To illustrate this principle, we describe a Fiat--Shamir-style authentication protocol that be can be implemented using any binary operation that satisfies…

Let G' be a connected reductive group over the complex numbers. We show that the set of conjugacy classes of G' is in natural bijection with the set of two-sided cells associated to a certain algebra.

In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.

We provide two alternative ways to determine the number of (bi-)twisted conjugacy classes in a finite group: one by counting certain irreducible characters and one by counting certain twisted conjugacy classes of other endomorphisms. In…

We consider several computational problems related to conjugacy between subshifts of finite type, restricted to $k$-block codes: verifying a proposed $k$-block conjugacy, deciding if two shifts admit a $k$-block conjugacy, and reducing the…

We construct a family of links we call torus necklaces for which the link groups are precisely the braid groups of generalised $J$-reflection groups. Moreover, this correspondence exhibits the meridians of the aforementioned link groups as…

In this paper, we study the interaction between the totally positive monoid $G_{\ge 0}$ attached to a connected reductive group $G$ with a pinning and the conjugacy classes in $G$. In particular, we study how a conjugacy class meets the…

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,…

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…

In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…

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…

We provide explicit and unified formulae for the normalized 3-cocycles on arbitrary finite abelian groups. As an application, we compute all the braided monoidal structures on linear Gr-categories.

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…

Let $\beta:=\sigma_1\sigma_2^{-1}$ be a braid in $B_3$, where $B_3$ is the braid group on 3 strings and $\sigma_1, \sigma_2$ are the standard Artin generators. We use Gauss diagram formulas to show that for each natural number $n$ not…

We construct two practical algorithms for twisted conjugacy classes of polycyclic-by-finite groups. The first algorithm determines whether two elements of a group are twisted conjugate for two given endomorphisms, under the condition that…

Using the band representation of the 3-strand braid group, it is shown that the genus of 3-braid links can be read off their skein polynomial. Some applications are given, in particular a simple proof of Morton's conjectured inequality and…

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…

Dehn twists around simple closed curves in oriented surfaces satisfy the braid relations. This gives rise to a group theoretic from the braid group to the mapping class group. We prove here that this map is trivial in stable homology with…

We provide linear lower bounds for the signature of positive braids in terms of the three genus of their braid closure. This yields linear bounds for the topological slice genus of knots that arise as closures of positive braids.

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…