Related papers: Conjugacy and Dynamics in Thompson's Groups

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…

Presentations are computed for a braided version BV of Thompson's group V and for V itself showing that there is an Artin group/Coxeter group relation between them. The presentation for V is obtained from that for BV by declaring all that…

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

Monod introduced in [14] a family of Thompson-like groups which provides natural counterexamples to the von Neumann-Day conjecture. We construct a characterization of conjugacy and invariant and use them to compute centralizers in one group…

The main result of this article is that any braided (resp. annular, planar) diagram group $D$ splits as a short exact sequence $1 \to R \to D \to S \to 1$ where $R$ is a subgroup of some right-angled Artin group and $S$ a subgroup of…

We present a generalization of the Dehornoy-Brin braided Thompson group $BV_2$ that uses recursive braids. Our new groups are denoted by $BV_{n,r}(H)$, for all $n\geq 2,r\geq 1$ and $H \leq \mathcal{B}_n$, where $\mathcal{B}_n$ is the braid…

Pursueing our investigations on the relations between Thompson groups and mapping class groups, we introduce the group $T^*$ (and its further generalizations) which is an extension of the Ptolemy-Thompson group $T$ by means of the full…

An introduction to the universal algebra approach to Higman-Thompson groups (including Thompson's group $V$) is given, following a series of lectures by Graham Higman in 1973. In these talks, Higman outlined an algorithm for the conjugacy…

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

Golan and Sapir \cite{MR3978542} proved that the Thompson's groups $F$, $T$ and $V$ have linear divergence. In the current paper, we focus on the divergence properties of several generalisation of the Thompson's groups, we first consider…

Structure monoids and groups are algebraic invariants of equational varieties. We show how to construct presentations of these objects from coherent categorifications of equational varieties, generalising several results of Dehornoy. We…

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…

We prove Thompson's group $F$ has quadratic conjugator length function. That is, for any two conjugate elements of $F$ of length $n$ or less, there exists an element of $F$ of length $O(n^2)$ that conjugates one to the other. Moreover,…

Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…

We prove that Thompson's groups $F$ and $V$ are the geometry groups of associativity, and of associativity together with commutativity, respectively. We deduce new presentations of $F$ and $V$. These presentations lead to considering a…

An Ore forest-skein category provides three forest-skein groups equipped with a powerful diagrammatic calculus analogous to Richard Thompson's groups F,T,V. We investigate when forest-skein groups have simple derived subgroups and establish…

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…

In this article, we propose a geometric framework dedicated to the study of van Kampen diagrams of graph products of groups. As an application, we find information on the word and the conjugacy problems. The main new result of the paper…

Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established protocols based on numeric computation. Notably, the protocols…

Jones introduced a method to produce unoriented links from elements of the Thompson's group $F$, and proved that any link can be produced by this construction. In this paper, we attempt to investigate the relations between conjugacy classes…