Related papers: Conjugacy problem for subgroups with applications …

Braid groups may be defined for every Coxeter diagram. Artin's braid group is of type A. Analogs of Temperley-Lieb, Hecke and Birman-Wenzl algebras exist for B-type. Our general hypothethis is that the braid group of B-type replaces Artin's…

For a fixed $n\ge2$, the Houghton group $H_n$ consists of bijections of $X_n=\{1,\ldots,n\} \times \mathbb{N}$ that are `eventually translations' of each copy of $\mathbb{N}$. The Houghton groups have been shown to have solvable conjugacy…

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…

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…

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…

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…

The set of all centralizers of elements in a finite group $G$ is denoted by $Cent(G)$ and $G$ is called $n-$centralizer if $|Cent(G)| = n$. In this paper, the structure of centralizers in a non-abelian finite group $G$ with this property…

A result of Allock [1](arXiv:math/9907194) states that certain orbifold braid groups contain Artin groups of type $D_n$, $\tilde{B}_n$ and $\tilde{D}_n$ as finite index subgroups. The underlying orbifolds have at most two cone points of…

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…

We provide a general formula for Mueger's centralizer of any fusion subcategory of a braided fusion category containing a tannakian subcategory. This entails a description for Mueger's centralizer of all fusion subcategories of a group…

We explicitly construct an embedding of a right-angled Artin group into a classical pure braid group. Using this we obtain a number of corollaries describing embeddings of arbitrary Artin groups into right-angled Artin groups and linearly…

In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two…

Let H and K be quasiconvex subgroups of a negatively curved torsion-free group G. We give an algorithm which decides whether an element of H is conjugated in G to an element of K.

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…

We study conjugacy relations on semigroups and monoids, focusing on the relation $a \cfn b$, defined by the existence of $g,h \in S^1$ such that $ag = gb$, $bh = ha$, $hag = b$, and $gbh = a$. This notion emerged as one that yields…

From a group $H$ and a non-trivial element $h$ of $H$, we define a representation $\rho: 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…

Let $n\in \mathbb{N}$. Houghton's group $H_n$ is the group of permutations of $\{1,\dots, n\}\times \mathbb{N}$, that eventually act as a translation in each copy of $\mathbb{N}$. We prove the solvability of the conjugacy problem and…

We construct an embedding of any right-angled Artin group $G(\Delta)$ defined by a graph $\Delta$ into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of $\Delta$. This construction…

In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…

Let $G$ be an algebraic group of type $G_2$ over a field $k$ of characteristic $\neq 2,3$. In this paper we calculate centralizers of semisimple elements in anisotropic $G_2$. Using these, we show explicitly that there are six conjugacy…