Related papers: Conjugacy and Dynamics in Thompson's Groups

Several key agreement protocols are based on the following "Generalized Conjugacy Search Problem": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the…

In this paper, we continue our study of the class of diagram groups. Simply speaking, a diagram is a labelled plane graph bounded by a pair of paths (the top path and the bottom path). To multiply two diagrams, one simply identifies the top…

Recently the third named author defined a 2-parametric family of groups $G_n^k$ \cite{gnk}. Those groups may be regarded as a certain generalisation of braid groups. Study of the connection between the groups $G_n^k$ and dynamical systems…

Hughes defined a class of groups that act as local similarities on compact ultrametric spaces. Guba and Sapir had previously defined braided diagram groups over semigroup presentations. The two classes of groups share some common…

We show how to approximate diffeomorphisms of the closed interval and the circle by elements of Thompson's groups $F$ and $T$, respectively. This is relevant in the context of Jones' continuum limit of discrete multipartite systems and its…

In this short article, we prove that any automorphism of the R. Thompson's group $F$ has infinitely many twisted conjugacy classes. The result follows from the work of Matthew Brin, together with a standard facts on R. Thompson's group $F$,…

We describe subgroups and overgroups of the generalised Thompson groups $V_n$ which arise via conjugation by rational homeomorphisms of Cantor space. We specifically consider conjugating $V_n$ by homeomorphisms induced by synchronizing…

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…

A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…

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…

We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…

Cactus groups and their pure subgroups appear in various fields of mathematics and are currently attracting attention from diverse mathematical communities. They share similarities with both right-angled Coxeter groups and braid groups. In…

The braided Ptolemy-Thompson group $T^*$ is an extension of the Thompson group $T$ by the full braid group $B_{\infty}$ on infinitely many strands. This group is a simplified version of the acyclic extension considered by Greenberg and…

We construct rearrangement groups for edge replacement systems, an infinite class of groups that generalize Richard Thompson's groups F, T, and V . Rearrangement groups act by piecewise-defined homeomorphisms on many self-similar…

Braided Thompson's groups are finitely presented groups introduced by Brin and Dehornoy which contain the ordinary braid groups $B_n$, the finitary braid group $B_{\infty}$ and Thompson's group $F$ as subgroups. We describe some of the…

Flux compactification of string theory generates an ensemble with a large number of vacua called the landscape. By using the statistics of various properties of low-energy effective theories in the string landscape, one can therefore hope…

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…

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…

For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable…

The groups G_{k,1} of Richard Thompson and Graham Higman can be generalized in a natural way to monoids, that we call M_{k,1}, and to inverse monoids, called Inv_{k,1}; this is done by simply generalizing bijections to partial functions or…