Related papers: Conjugator length in Thompson's groups
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…
Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…
We discuss metric and combinatorial properties of Thompson's group T, including normal forms for elements and unique tree pair diagram representatives. We relate these properties to those of Thompson's group F when possible, and highlight…
Modelled on efficient algorithms for solving the conjugacy problem in hyperbolic groups, we define and study the permutation conjugacy length function. This function estimates the length of a short conjugator between words $u$ and $v$, up…
In this paper, we establish upper bounds on the length of the shortest conjugator between pairs of infinite order elements in a wide class of groups. We obtain a general result which applies to all hierarchically hyperbolic groups, a class…
The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…
We prove that Thompson's group $T$ and, more generally, all the Higman-Thompson groups $T_n$ have quadratic Dehn function.
We introduce a new method for computing the word length of an element of Thompson's group F with respect to a "consecutive" generating set of the form X_n={x_0,x_1,...,x_n}, which is a subset of the standard infinite generating set for F.…
We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to…
We show that Thompson's group F does not satisfy Cannon's almost convexity condition AC(n) for any integer n in the standard finite two generator presentation. To accomplish this, we construct a family of pairs of elements at distance n…
We study some combinatorial properties of the word metric of Thompson's group F in the standard two generator finite presentation. We explore connections between the tree pair diagram representing an element w of F, its normal form in the…
We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand…
We prove that the Dehn function (that is, the smallest isoperimetric function) of the Richard Thompson's group F is quadratic.
We construct the first examples of finitely presented groups where the conjugator length function is exponential; these are central extensions of groups of the form $F_m \rtimes F_2$. Further, we use a fibre product construction to exhibit…
We consider locally compact subgroups $H$ of the full isometry group $\mathrm{Isom}(\mathbb{E}^n)$ of Euclidean $n$-space which respect the splitting into an orthogonal and a translation subgroup. We prove that the conjugator length…
Let $G$ be a finite group, and let $N(G)$ be the set of sizes of its conjugacy classes. We show that if a finite group $G$ has trivial center and $N(G)$ equals to $N(Alt_n)$ or $N(Sym_n)$ for $n\geq 23$, then $G$ has a composition factor…
Each element of the commutator subgroup of a group can be represented as a product of commutators. The minimal number of factors in such a product is called the commutator length of the element. The commutator length of a group is defined…
Given groups $A$ and $B$, what is the minimal commutator length of the 2020th (for instance) power of an element $g\in A*B$ not conjugate to elements of the free factors? The exhaustive answer to this question is still unknown, but we can…
Let $G$ be a finite group, $N(G)$ be the set of conjugacy classes of the group $G$. In the present paper it is proved $G\simeq L$ if $N(G)=N(L)$, where $G$ is a finite group with trivial center and $L$ is a finite simple group.
We prove that Thompson's group $F$ has a generating set with two elements such that every two powers of them generate a finite index subgroup of $F$.