Related papers: Conjugator Length in Finitely Presented Groups
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…
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…
In this paper, we compute an upper bound for the Dehn function of a finitely presented metabelian group. In addition, we prove that the same upper bound works for the relative Dehn function of a finitely generated metabelian group. We also…
We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also…
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 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,…
We show the connection between the relative Dehn function of a finitely generated metabelian group and the distortion function of a corresponding subgroup in the wreath product of two free abelian groups of finite rank. Further, we show…
We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…
We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…
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…
We construct a finitely presented group $G$ with non-quadratic Dehn function $f$ majorizable by a quadratic function on arbitrary long intervals.
For a surface group $\pi_1(\Sigma_g)=\langle c_1,\dots , c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\rangle$ with genus $g\geq 2$, we provide an explicit bound $n-1\leq \mathrm{CL}(2n)=\mathrm{CL}(2n+1)\leq n+8g-1$ for the…
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 the conjugator length function of the Baumslag-Gersten group is bounded above and below by a tower of exponentials of logarithmic height -- in particular it grows faster than any tower of exponentials of fixed height. We…
Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…
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…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
We exhibit novel geometric phenomena in the study of conjugacy problems for discrete groups. We prove that the snowflake groups $B_{pq}$, indexed by pairs of positive integers $p>q$, have conjugator length functions $\text{CL}(n)\simeq n$…
We construct a finitely presented group with undecidable word problem and with Dehn function bounded by a quadratic function on an infinite set of positive integers.
On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions $d(n)$ with growth at least $n^4$ (essentially all possible…