Embedding $\mathbb{Q}$ into a Finitely Presented Group
James Belk, James Hyde, Francesco Matucci
备注:
7 pages, no figures; to appear in $\textit{Bulletin of the American Mathematical Society}$. This version contains only the embedding of $\mathbb{Q}$ into the group of all lifts of elements of Thompson's group $T$ to the real line. The discussion of the group $T\mathcal{A}$ will appear elsewhere
We observe that the group of all lifts of elements of Thompson's group $T$ to the real line is finitely presented and contains the additive group $\mathbb{Q}$ of the rational numbers. This gives an explicit realization of the Higman embedding theorem for $\mathbb{Q}$, answering a Kourovka notebook question of Martin Bridson and Pierre de la Harpe.
We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented non-amenable groups without noncyclic free subgroups (which provides a finitely presented counterexample to the von Neumann problem on amenable groups). As another application, we construct weakly finitely presented groups of odd exponent $n \gg 1$ which are not locally finite.
We construct easy embeddings of relatively free groups (say the free Burnside group, the free solvable group) into finitely presented groups. We introduce a concept of verbal isoperimetric function of a group variety. We prove that if the verbal Dehn function of a relatively free group is bounded by a polynomial then the group can be embedded quasi-isometrically into a finitely presented group with polynomial isoperimetric function. We also construct an easy embedding of any Baumslag-Solitar solvable group into a finitely presented group with polynomial Dehn function.
In this paper we study distortion of various well-known embeddings of finitely generated torsion-free nilpotent groups $G$ into unitriangular groups $UT_n(\mathbb{Z})$. We also provide a polynomial time algorithm for finding distortion of a given subgroup of $G$
We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a Boone-Higman-Thompson type theorem for left-orderable groups with recursively enumerable positive cones. These embeddings are Frattini embeddings, and isometric whenever the initial group is finitely generated. Finally, we reprove Thompson's theorem on word problem preserving embeddings into finitely generated simple groups and observe that the embedding is …
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.
We give a complete survey of a construction by Boone and Collins for embedding any finitely presented group into one with $8$ generators and $26$ relations. We show that this embedding preserves the set of orders of torsion elements, and in particular torsion-freeness. We combine this with the independent results of Belegradek and Chiodo to prove that there is an $8$-generator $26$-relator universal finitely presented torsion-free group (one into which all finitely presented torsion-free groups embed).
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.
We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated $3$-step solvable group has finite palindromic width. More generally, we show the finiteness of palindromic width for finitely generated abelian-by-nilpotent-by-nilpotent groups. For arbitrary solvable groups of step $\geq 3$, we prove that if $G$ is a finitely generated solvable group that is an extension of an abelian group by a group satisfying the maximal condition for normal subgroups, then the palindromic width of $G$ is finite. We also prove that the palindromic width of $\…
We prove a factorization theorem for Fuchsian groups similar to those proved by Agol and Liu for 3-manifold groups. As an application, we build Makanin-Razborov diagrams, which parametrize the collection of all discrete representations from an arbitrary but fixed finitely generated group $G$ to ${\rm PSL}(2, \mathbb{R})$. We define a new class of groups called ${\rm PSL}(2, \mathbb{R})$-discrete limit groups and then use the factorization theorem to obtain useful information about this class of groups.
We generalize the small cancellation theory over hyperbolic groups developed by Olshanskii to the case of relatively hyperbolic groups. This allows us to construct infinite finitely generated groups with exactly $n$ conjugacy classes for every $n\ge 2$. In particular, we give the affirmative answer to the well--known question of the existence of a finitely generated group $G$ other than $\mathbb Z/2\mathbb Z$ such that all nontrivial elements of $G$ are conjugate.
The congruence subgroup problem for a finitely generated group $Γ$ and $G\leq Aut(Γ)$ asks whether the map $\hat{G}\to Aut(\hatΓ)$ is injective, or more generally, what is its kernel $C\left(G,Γ\right)$? Here $\hat{X}$ denotes the profinite completion of $X$. In the case $G=Aut(Γ)$ we denote $C\left(Γ\right)=C\left(Aut(Γ),Γ\right)$. Let $Γ$ be a finitely generated group, $\barΓ=Γ/[Γ,Γ]$, and $Γ^{*}=\barΓ/tor(\barΓ)\cong\mathbb{Z}^{(d)}$. Denote $Aut^{*}(Γ)=\textrm{Im}(Aut(Γ)\to Aut(Γ^{*}))\leq GL_{d}(\mathbb{Z})$. In this paper we show that when $Γ$ is nilpotent, there is a canonical isomorphi…
We prove that torsion in the abelianizations of open normal subgroups in finitely presented pro-$p$ groups can grow arbitrarily fast. By way of contrast in $\mathbb Z_p$- analytic groups the torsion growth is at most polynomial.
We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite group with solvable word problem for which there is no effective method that allows, given some non-identity element, to find a morphism onto a finite group in which this element has a non-trivial image. We also prove that the depth function of this group grows faster than any recursive function.
We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even asynchronously automatic. We can also arrange that such subgroups satisfy, at best, an exponential isoperimetric inequality.
We study a function $\mathcal{L}_Γ$ which quantifies the LEF (local embeddability into finite groups) property for a finitely generated group $Γ$. We compute this "LEF growth" function in some examples, including certain wreath products. We compare LEF growth with the analogous quantitative version of residual finiteness, and exhibit a family of finitely generated residually finite groups which nevertheless admit many more local embeddings into finite groups than they do finite quotients. Along the way, we give a new proof that B.H. Neumann's continuous family of $2$-generated groups contains …
We introduce a quantitative notion of lawlessness for finitely generated groups, encoded by the "lawlessness growth function" $\mathcal{A}_Γ : \mathbb{N} \rightarrow \mathbb{N}$. We show that $\mathcal{A}_Γ$ is bounded iff $Γ$ has a nonabelian free subgroup. By contrast we construct, for any nondecreasing unbounded function $f: \mathbb{N} \rightarrow \mathbb{N}$, an elementary amenable lawless groups for which $\mathcal{A}_Γ$ grows more slowly that $f$. We produce torsion lawless groups for which $\mathcal{A}_Γ$ is at least linear using Golod-Shafarevich theory, and give some upper bounds on $…
In the present paper we continue studying regular free group actions on $\mathbb{Z}^n$-trees. We show that every finitely generated $\mathbb{Z}^n$-free group $G$ can be embedded into a finitely generated $\mathbb{Z}^n$-free group $H$ acting regularly on the underlying $\mathbb{Z}^n$-tree (we call $H$ a {\em regular $\mathbb{Z}^n$-completion} of $G$) so that the action of $G$ is preserved. Moreover, if $G$ is effectively represented as a group of $\mathbb{Z}^n$-words then the construction of $H$ is effective and $H$ is also effectively represented as a group of $\mathbb{Z}^n$-words.
We demonstrate under appropriate finiteness conditions that a coarse embedding induces an inequality of homological Dehn functions. Applications of the main results include a characterization of what finitely presentable groups may admit a coarse embedding into a hyperbolic group of geometric dimension $2$, characterizations of finitely presentable subgroups of groups with quadratic Dehn function with geometric dimension $2$, and to coarse embeddings of nilpotent groups into other nilpotent groups of the same growth and into hyperbolic groups.
For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a presentation $G=\langle A\mid R\rangle$ with a finite set of generators $A$ and a recursively enumerable set $R$ of defining relations if and only if it is a subgroup of a group $H$ finitely presented in the variety ${\cal B}_n$. It follows that there is a 'universal' $2$-generated finitely presented in ${\cal B}_n$ group containing isomorphic copies of all fin…
We construct new examples of CAT(0) groups containing non finitely presented subgroups that are of type $FP_2$, these CAT(0) groups do not contain copies of $\mathbb{Z}^3$. We also give a construction of groups which are of type $F_n$ but not $F_{n+1}$ with no free abelian subgroups of rank greater than $\lceil\frac{n}{3}\rceil$.
We combine classical methods of combinatorial group theory with the theory of small cancellations over relatively hyperbolic groups to construct finitely generated torsion-free groups that have only finitely many classes of conjugate elements. Moreover, we present several results concerning embeddings into such groups. As another application of these techniques, we prove that every countable group $C$ can be realized as a group of outer automorphisms of a group $N$, where $N$ is a finitely generated group having Kazhdan's property (T) and containing exactly two conjugacy classes.
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 conjugacy problem. Moreover G and H have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D. Collins.
Since the work of Jennings (1955), it is well-known that any finitely generated torsion-free nilpotent group can be embedded into unitriangular integer matrices $UT_N(Z)$ for some $N$. In 2006, Nickel proposed an algorithm to calculate such embeddings. In this work, we show that if $UT_n(Z)$ is embedded into $UT_N(Z)$ using Nickel's algorithm, then $N \geq 2^{n/2 -2}$ if the standard ordering of the Mal'cev basis (as in Nickel's original paper) is used. In particular, we establish an exponential worst-case running time of Nickel's algorithm. On the other hand, we also prove a general exponenti…
We show that for any $n\geq 2$, two elements selected uniformly at random from a \emph{symmetrized} Euclidean ball of radius $X$ in $\textrm{SL}_n(\mathbb Z)$ will generate a thin free group with probability tending to $1$ as $X\rightarrow \infty.$ This is done by showing that the two elements will form a ping-pong pair, when acting on a suitable space, with probability tending to $1$. On the other hand, we give an upper bound less than $1$ for the probability that two such elements will form a ping-pong pair in the usual Euclidean ball model in the case where $n>2$.
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 describe finitely generated groups $H$ universally equivalent (with constants from $G$ in the language) to a given torsion-free relatively hyperbolic group $G$ with free abelian parabolics. It turns out that, as in the free group case, the group $H$ embeds into the Lyndon's completion $G^{\mathbb{Z}[t]}$ of the group $G$, or, equivalently, $H$ embeds into a group obtained from $G$ by finitely many extensions of centralizers. Conversely, every subgroup of $G^{\mathbb{Z}[t]}$ containing $G$ is universally equivalent to $G$. Since finitely generated groups universally equivalent …
We construct a finitely generated group which is an extension of two finitely generated groups coarsely embeddable into Hilbert space but which itself does not coarsely embed into Hilbert space. Our construction also provides a new infinite monster group: the first example of a finitely generated group that does not coarsely embed into Hilbert space and yet does not contain a weakly embedded expander.
We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the equivalence between the isomorphism problem within the subclass of unique $\mathbb{Z}$-extensions, and the semi-conjugacy problem for deranged outer automorphisms.
In this note we introduce the class of $\mathcal H$-groups (or Hall groups) related to the class of $\mathcal B$-groups defined by Ph. Hall in 1950's. Establishing some basic properties of Hall groups we use them to obtain results concerning embeddings of abelian groups. In particular, we give an explicit classification of all abelian groups that can occur as subgroups in finitely-generated metabelian groups. Hall groups allow to give a negative answer to the Baumslag's conjecture of 1990 on the cardinality of the set of isomorphism classes for abelian subgroups in finitely generated metabelia…
A new class of groups $\mathcal{C}$, containing all coherent RAAGs and all toral relatively hyperbolic groups, is defined. It is shown that, for a group $G$ in the class $\mathcal{C}$, the $\mathbb{Z}[t]$-exponential group $G^{\mathbb{Z}[t]}$ may be constructed as an iterated centraliser extension. Using this fact, it is proved that $G^{\mathbb{Z}[t]}$ is fully residually $G$ (i.e. it has the same universal theory as $G$) and so its finitely generated subgroups are limit groups over $G$. If $\mathbb{G}$ is a coherent RAAG, then the converse also holds - any limit group over $\mathbb{G}$ embeds…
In this paper, we consider an equivalence relation within the class of finitely presented discrete groups attending to their asymptotic topology rather than their asymptotic geometry. More precisely, we say that two finitely presented groups $G$ and $H$ are "proper $2$-equivalent" if there exist (equivalently, for all) finite $2$-dimensional CW-complexes $X$ and $Y$, with $π_1(X) \cong G$ and $π_1(Y) \cong H$, so that their universal covers $\widetilde{X}$ and $\widetilde{Y}$ are proper $2$-equivalent. It follows that this relation is coarser than the quasi-isometry relation. We point out that…
We prove that every finitely generated group $G$ discriminated by a locally quasi-convex torsion-free hyperbolic group $Γ$ is effectively coherent: that is, presentations for finitely generated subgroups can be computed from the subgroup generators. We study $G$ via its embedding into an iterated centralizer extension of $Γ$, and prove that this embedding can be computed. We also give algorithms to enumerate all finitely generated groups discriminated by $Γ$ and to decide whether a given group, with decidable word problem, is discriminated by $Γ$. If $Γ$ may have torsion, we prove that groups …
Let $Δ$ be a cocompact lattice in $\mathsf{Sp}(m,1)$, $m \geq 2$, or $F_{4}^{(-20)}$. We exhibit examples of finitely generated subgroups of $Δ\times Δ$ with positive first Betti number all of whose discrete faithful representations into any real semisimple Lie group are quasi-isometric embeddings. The examples of this paper are inspired by the counterexamples of Bass-Lubotzky [BL00] to Platonov's conjecture.
We prove that every finitely-generated right-angled Artin group can be embedded into some Brin-Thompson group $nV$. It follows that many other groups can be embedded into some $nV$ (e.g., any finite extension of any of Haglund and Wise's special groups), and that various decision problems involving subgroups of $nV$ are unsolvable.
We show that there is an order-preserving embedding of the additive group of rational numbers $\mathbb{Q}$ into a 2-generator group $G$. The group $G$ can be chosen to be a solvable group $G$ of length 3, which is a minimal result in the sense that it cannot be chosen to be neither solvable of length 2, nor a nilpotent group. For any non-trivial word set $V \subseteq F_\infty$ there is an order-preserving verbal embedding of $\mathbb{Q}$ into a 2-generator group $G$. The embeddings constructed are subnormal.
It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into $GL_{n}(\mathbb{Z})$ for an appropriate $n\in \mathbb{N}$; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in Nickel. In this paper, we determine the complexity of the crux of the algorithm and the dimension of the matrices produced as well as provide a modification of the algorithm presented by Nickel.
Whenever a finitely generated group $G$ acts properly discontinuously by isometries on a metric space $X$, there is an induced uniform embedding (a Lipschitz and uniformly proper map) $ρ: G \rightarrow X$ given by mapping $G$ to an orbit. We study when there is a difference between a finitely generated group $G$ acting properly on a contractible $n$-manifold and uniformly embedding into a contractible $n$-manifold. For example, Kapovich and Kleiner showed that there are torsion-free hyperbolic groups that uniformly embed into a contractible $3$-manifold but only virtually act on a contractible…
We construct an example of a finitely-generated amenable group that does not admit any coarse 1-Lipschitz embedding with positive compression exponent into L_p for any 1 \leq p < \infty, answering positively a question of Arzhantseva, Guba and Sapir.
Let $M = \mathbb{B}^2 / Γ$ be a smooth ball quotient of finite volume with first betti number $b_1(M)$ and let $\mathcal{E}(M) \ge 0$ be the number of cusps (i.e., topological ends) of $M$. We study the growth rates that are possible in towers of finite-sheeted coverings of $M$. In particular, $b_1$ and $\mathcal{E}$ have little to do with one another, in contrast with the well-understood cases of hyperbolic $2$- and $3$-manifolds. We also discuss growth of $b_1$ for congruence arithmetic lattices acting on $\mathbb{B}^2$ and $\mathbb{B}^3$. Along the way, we provide an explicit example of a l…