Related papers: Embeddings of relatively free groups into finitely…
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 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…
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…
To each finitely generated group $G$, we associate a quasi-isometric invariant called the \emph{Dehn spectrum} of $G$. If $G$ is finitely presented, our invariant is closely related to the Dehn function of $G$, but provides more information…
We construct the first examples of finitely presented groups with quadratic Dehn function containing a finitely generated infinite torsion subgroup. These examples are "optimal" in the sense that the Dehn function of any such finitely…
We construct the first examples of finitely presented groups with cubic Dehn function containing a finitely generated infinite torsion subgroup. Moreover, we show that any infinite free Burnside group with sufficiently large odd exponent…
We show that every group $H$ of at most exponential growth with respect to some left invariant metric admits a bi-Lipschitz embedding into a finitely generated group $G$ such that $G$ is amenable (respectively, solvable, satisfies a…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
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…
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…
We construct examples of finitely presented simple groups whose Dehn functions are at least exponential. To the best of our knowledge, these are the first such examples known. Our examples arise from R\"over-Nekrashevych groups, using…
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…
The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…
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.
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 exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…
We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
It is shown that there exist infinitely many non-integers $r>2$ such that the Dehn function of some finitely presented group is $\simeq n^r$. For each positive rational number $s$ we construct pairs of finitely presented groups $H\subset G$…
For a finitely generated group $G$ and collection of subgroups $\mathcal{P}$ we prove that the relative Dehn function of a pair $(G,\mathcal{P})$ is invariant under quasi-isometry of pairs. Along the way we show quasi-isometries of pairs…