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 functions which can be realized as the conjugator length function of a finitely presented group, showing that it contains every function that can be realized as the Dehn function of a finitely presented group. In particular, given a real number $α\geq2$ which is computable in double-exponential time, we show there exists a finitely presented group whose conjugator length function is asymptotically equivalent to $n^α$. This yields a substantial refinement to results of Bridson and Riley. We attain this result through the computational model of $S$-machines, achieving the more general result that any sufficiently large function which can be realized as the time function of an $S$-machine can also be realized as the conjugator length function of a finitely presented group. Finally, we use the constructed groups to explore the relationship between the conjugator length function, the Dehn function, and the annular Dehn function in finitely presented groups.
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, there exist conjugate pairs of elements of $F$ of length at most $n$ such that the shortest conjugator between them has length $Ω(n^2)$. This latter statement holds for $T$ and $V$ as well.
In this paper we explore relationships between divergence and thick groups, and with the same techniques we estimate lengths of shortest conjugators. We produce examples, for every positive integer n, of CAT(0) groups which are thick of order n and with polynomial divergence of order n+1, both these phenomena are new. With respect to thickness, these examples show the non-triviality at each level of the thickness hierarchy defined by Behrstock-Drutu-Mosher. With respect to divergence our examples resolve questions of Gromov and Gersten (the divergence questions were also recently and independe…
Suppose that a finitely generated group $G$ is hyperbolic relative to a collection of subgroups $\mathbb{P}=\{P_1,\dots,P_m\}$. Let $H_1,H_2$ be subgroups of $G$ such that $H_1$ is relatively quasiconvex with respect to $\mathbb{P}$ and $H_2$ is not parabolic. Suppose that $H_2$ is elementwise conjugate into $H_1$. Then there exists a finite index subgroup of $H_2$ which is conjugate into $H_1$. The minimal length of the conjugator can be estimated. In the case where $G$ is a limit group, it is sufficient to assume only that $H_1$ is a finitely generated and $H_2$ is an arbitrary subgroup of $…
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 to taking cyclic permutations. This function might be bounded by a constant, even in the case when the standard conjugacy length function is unbounded. We give applications to the complexity of the conjugacy problem, estimating conjugacy growth rates, and languages. Our main result states that for a relatively hyperbolic group, the permutation conjugacy lengt…
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 functions under group extensions, introducing the twisted and restricted conjugacy length functions. We apply these results to show that certain abelian-by-cyclic groups have linear conjugacy length function and certain semidirect products $\Z^d \rtimes \Z^k$ have at most exponential (if $k >1$) or linear (if $k=1$) conjugacy length functions.
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 the definition of the conjugacy length function. We show that for free solvable groups the conjugacy length function is at most cubic. For wreath products the behaviour depends on the conjugacy length function of the two groups involved, as well as subgroup distortion within the quotient group.
We study subgroups $H_U$ of the R. Thompson group $F$ which are stabilizers of finite sets $U$ of numbers in the interval $(0,1)$. We describe the algebraic structure of $H_U$ and prove that the stabilizer $H_U$ is finitely generated if and only if $U$ consists of rational numbers. We also show that such subgroups are isomorphic surprisingly often. In particular, we prove that if finite sets $U\subset [0,1]$ and $V\subset [0,1]$ consist of rational numbers which are not finite binary fractions, and $|U|=|V|$, then the stabilizers of $U$ and $V$ are isomorphic. In fact these subgroups are conju…
This is the first of a three parts paper providing full details for our previous announcement in Prépublications Orsay 2007-16, arXiv:0711.3579. Here we prove the results stated in the title.
Bestvina, Feighn and Handel proved that every subgroup of the outer automorphism group, $\textrm{Out}(F_n)$, of the free group of rank $n$ is either virtually finitely generated abelian or contains a nonabelian free group. In this note we consider the more general situation of the outer automorphism group $\textrm{Out}(G)$ of a finitely generated free-by-finite group $G$. We show that $\textrm{Out}(G)$ is translation discrete and that every subgroup of $\textrm{Out}(G)$ is either virtually finitely generated abelian or contains a nonabelian free group.
We provide the first example of a finitely presented (in fact, type $F_\infty$) group with elements whose stable commutator length is algebraic and irrational, answering a question of Calegari. Our example is the lift to the real line of the \emph{golden ratio Thompson group} $T_τ$: the circle analogue of the Cleary's golden ratio Thompson group $F_τ$ which acts on the interval.
It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length vanishes. Moreover, a recursive presentation of such a group with decidable word and conjugacy problems is constructed.
Following the work done by Olshanskii for groups, we describe, for a given semigroup $S$, which functions $l : S \rightarrow \mathbb{N}$ can be realized up to equivalence as length functions $g \mapsto |g|_{H}$ by embedding $S$ into a finitely generated semigroup $H$. We also, following the work done by Olshanskii and Sapir, provide a complete description of length functions of a given finitely generated semigroup with enumerable set of relations inside a finitely presented semigroup.
A famous result of Hall asserts that the multiplication and exponentiation in finitely generated torsion free nilpotent groups can be described by rational polynomials. We describe an algorithm to determine such polynomials for all torsion free nilpotent groups of given Hirsch length. We apply this to determine the Hall polynomials for all such groups of Hirsch length at most 7.
A group is called $Λ$-free if it has a free Lyndon length function in an ordered abelian group $Λ$, which is equivalent to having a free isometric action on a $Λ$-tree. A group has a regular free length function in $Λ$ if and only if it has a free isometric action on a $Λ$-tree so that all branch points belong to the orbit of the base point. In this paper we prove that every finitely presented $Λ$-free group $G$ can be embedded into a finitely presented group with a regular free length function in $Λ$ so that the length function on $G$ is preserved by the embedding. Next, we prove that every f…
We study the relative growth of finitely generated subgroups in finitely generated groups, and the corresponding distortion function of the embeddings. We explore which functions are equivalent to the relative growth functions and distortion functions of finitely generated subgroups. We also study the connections between these two asymptotic invariants of group embeddings. We give conditions under which a length function on a finitely generated group can be extended to a length function on a larger group.
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 braid group B_N, Hughes and Tannenbaum suggested a length-based approach to finding x. Since the introduction of this approach, its effectiveness and successfulness were debated. We introduce several effective realizations of this approach. In particular, a new length function is defined on B_N which possesses significantly better properties than the natural le…
Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling length as a function of length of edge-loops in the Cayley 2-complex. We give a bound on the filling length function in terms of the log of an isoperimetric function multiplied by a (simultaneously realisable) isodiametric function.
The set of finitely generated subgroups of the group $PL_+(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that every finitely generated subgroup $G<PL_+(I)$ is either soluble, or contains an embedded copy of Brin's group $B$, a finitely generated, non-soluble group, which verifies a conjecture of the first author from 2009. In the case that $G$ is soluble, we show that the derived length of $G$ is bounded above by the number of breakpoints of any finite set of generat…
We show that a construction by Aanderaa and Cohen used in their proof of the Higman Embedding Theorem preserves torsion length. We give a new construction showing that every finitely presented group is the quotient of some $C'(1/6)$ finitely presented group by the subgroup generated by its torsion elements. We use these results to show there is a finitely presented group with infinite torsion length which is $C'(1/6)$, and thus word-hyperbolic and virtually torsion-free.
In this paper, we present an explicit formula for the Baer invariant of a finitely generated abelian group with respect to the variety of polynilpotent groups of class row $(c_1,...,c_t)$, ${\cal N}_{c_1,...,c_t}$. In particular, one can obtain an explicit structure of the $\ell$-solvable multiplier (the Baer invariant with respect to the vaiety of solvable groups of length at most $\ell\geq 1,\ {\cal S}_{\ell}$.) of a finitely generated abelian group.
To every automorphism w of an infinite rooted regular binary tree we associate a two variable generating function Φ_w that encodes information on the orbit structure of w. We prove that this is a rational function if w can be described by finitely many recursion relations of a particular form. We show that this condition is satisfied for all elements of the discrete iterated monodromy group Γassociated to a postcritically finite quadratic polynomial over C. For such Γwe also prove that there are only finitely many possibilities for the denominator of Φ_w, and we describe a procedure to determi…
We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to show that the 9-element monoid $L_4^1$ is non-finitely based. The monoid $L_4^1$ was the only unsolved case in the finite basis problem for Lee monoids $L_\ell^1$, obtained by adjoining an identity element to the semigroup generated by two idempotents $a$ and $b$ subjected to the relation $0=abab \cdots$ (length $\ell$). We also prove a syntactic sufficient condition which is equivalent to the sufficient condition of Lee under which a semigroup is non-finitely based. This gives a new …
This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to study groups. All finitely generated groups acting freely on -trees also act freely on some Z^n-trees, but the latter ones form a much larger class. The natural effectiveness of all constructions for $Z^n-actions (which is not the case for R-trees) comes along with a robust algorithmic theory. In this paper we describe the algebraic structure of finitely genera…
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial with respect to the logarithm of the word length for infinite index subgroups of nilpotent groups. In the case of normal subgroups, we provide an exact computation generalizing work of the second author. We introduce a function that quantifies subgroup separability, and we provide polynomial upper and lower bounds. We finish by demonstrating that our results e…
If $G$ and $H$ are finitely generated residually nilpotent groups, then $G$ and $H$ are in the same nilpotent genus if they have the same lower central quotients (up to isomorphism). A stronger condition is that $H$ is para-$G$ if there exists a monomorphism of $G$ into $H$ which induces isomorphisms between the corresponding quotients of their lower central series. We first consider residually nilpotent groups and find sufficient conditions on the monomorphism so that $H$ is para-$G.$ We then prove that for certain polycyclic groups, if $H$ is para-$G$, then $G$ and $H$ have the same Hirsch l…
We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to Lee monoids $L_\ell^1$, obtained by adjoining an identity element to the semigroup generated by two idempotents $a$ and $b$ subjected to the relation $0=abab \cdots$ (length $\ell$). We show that every monoid which generates a variety containing $L_5^1$ and is contained in the variety generated by $L_\ell^1$ for some $\ell \ge 5$ is non-finitely based. We establish this result by analyzing $τ$-terms for $M$ where $τ$ is certain non-trivial congruence on the free semigroup, that is, we…
We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use relations from $R$ for elementary transformations to obtain the empty word; $s(n)$ bounds from above the tape space (or computer memory) one needs to transform any word of length at most $n$ vanishing in $G$ to the empty word. One of the main obtained results is the following criterion: A finitely generated group $H$ has decidable word problem of polynomial space co…
This note serves as a short and reader-friendly introduction to twisted Brin-Thompson groups, which were recently constructed by Belk and the author to provide a family of simple groups with a variety of interesting properties. Most notably, twisted Brin-Thompson groups can be used to show that every finitely generated group quasi-isometrically embeds as a subgroup of a finitely generated simple group. Another important application is a concrete construction of a family of simple groups with arbitrary finiteness length. In addition to giving a concise introduction to the groups and these appli…
We study the effects of subgroup distortion in the wreath products A wr Z, where A is finitely generated abelian. We show that every finitely generated subgroup of A wr Z has distortion function equivalent to some polynomial. Moreover, for A infinite, and for any polynomial l^k, there is a 2-generated subgroup of A wr Z having distortion function equivalent to the given polynomial. Also a formula for the length of elements in arbitrary wreath product H wr G easily shows that the group Z_2 wr Z^2 has distorted subgroups, while the lamplighter group Z_2 wr Z has no distorted (finitely generated)…
We introduce the space function $s(n)$ of a finitely presented semigroup $S =<A\mid R>.$ To define $s(n)$ we consider pairs of words $w,w'$ over $A$ of length at most $n$ equal in $S$ and use relations from $R$ for the transformations $w=w_0\to...\to w_t= w'$; $s(n)$ bounds from above the tape space (or computer memory) sufficient to implement all such transitions $w\to...\to w'.$ One of the results obtained is the following criterion: A finitely generated semigroup $S$ has decidable word problem of polynomial space complexity if and only if $S$ is a subsemigroup of a finitely presented semigr…
We give effective proofs of residual finiteness and conjugacy separability for finitely generated nilpotent groups. In particular, we give precise asymptotic bounds for a function introduced by Bou-Rabee that measures how large the quotients that are need to separate non-identity elements of bounded length from the identity which improves the work of Bou-Rabee. Similarly, we give polynomial upper and lower bounds for an analogous function introduced by Lawton, Louder, and McReynolds that measures how large the quotients that are need to separate pairs of distinct conjugacy classes of bounded w…
We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and finiteness of $G_{bound}$. We prove that if $G$ is virtually abelian then $G_{bound}$ is finite. In contrast with numerous examples where $G_{bound}$ is trivial, we show that for every finite group $A$, there exists an infinite group $G$ with $G_{bound}=A$. This group $G$ can be chosen among torsion groups. We also study the group $G_{bound}(d)$ of elements with …
In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in {\mathcal M}{\mathcal A}$ (${\mathcal A}$ means the variety of abelian groups). If $G$ is a finite group, then $H$ can also be found as a finite group. It follows, that any finitely generated (finite) solvable group $G$ of the derived length $l$ can be embedded in a $4$-generated (finite) solvable group $H$ of length $l+1$. Thus, we answer the question of V. H…
In this paper we survey recent developments in the theory of groups acting on $Λ$-trees. We are trying to unify all significant methods and techniques, both classical and recently developed, in an attempt to present various faces of the theory and to show how these methods can be used to solve major problems about finitely presented $Λ$-free groups. Besides surveying results known up to date we draw many new corollaries concerning structural and algorithmic properties of such groups.
We prove that every finitely generated, virtually solvable minimax group can be expressed as a homomorphic image of a virtually torsion-free, virtually solvable minimax group. This result enables us to generalize a theorem of Ch. Pittet and L. Saloff-Coste about random walks on finitely generated, virtually solvable minimax groups. Moreover, the paper identifies properties, such as the derived length and the nilpotency class of the Fitting subgroup, that are preserved in the covering process. Finally, we determine exactly which infinitely generated, virtually solvable minimax groups also posse…
We prove that every finitely generated nilpotent group of class c admits a polynomial isoperimetric function of degree c+1 and a linear upper bound on its filling length function.
The pro-isomorphic zeta function of a torsion-free finitely generated nilpotent group G enumerates finite index subgroups H such that H and G have isomorphic profinite completions. It admits an Euler product decomposition, indexed by the rational primes. We manufacture the first example of a torsion-free finitely generated nilpotent group G such that the local Euler factors of its pro-isomorphic zeta function do not satisfy functional equations. The group G has nilpotency class 4 and Hirsch length 25. It is obtained, via the Malcev correspondence, from a Z-Lie lattice L with a suitable algebra…
