Related papers: Algorithmic problems in groups with quadratic Dehn…

We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.

We prove that groups in a certain class of metabelian locally compact groups, have quadratic Dehn function. As an application, we embed the solvable Baumslag-Solitar groups into finitely presented metabelian groups with quadratic Dehn…

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…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

We investigate the complexity of the conjugacy problem for fibre products in torsion-free hyperbolic groups. Let $G$ be a torsion-free hyperbolic group and let $P<G\times G$ be the fibre product associated to an epimorphism…

We show that the Dehn function of the handlebody group is exponential in any genus $g\geq 3$. On the other hand, we show that the handlebody group of genus $2$ is cubical, biautomatic, and therefore has a quadratic Dehn function.

We calculate asymptotic estimates for the conjugacy growth function of finitely generated class 2 nilpotent groups whose derived subgroup is infinite cyclic, including the so-called higher Heisenberg groups. We prove that these asymptotics…

In this note we look at presentations of subgroups of finitely presented groups with infinite cyclic quotients. We prove that if $H$ is a finitely generated normal subgroup of a finitely presented group $G$ with $G/H$ cyclic, then $H$ has…

We prove super-quadratic lower bounds for the growth of the filling area function of a certain class of Carnot groups. This class contains groups for which it is known that their Dehn function grows no faster than $n^2\log n$. We therefore…

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.

We prove that, for every integer $n \ge 2$, a finite or infinite countable group $G$ can be embedded into a 2-generated group $H$ in such a way that the solvability of quadratic equations of length at most $n$ is preserved, i.e., every…

We prove that there is no algorithm that can determine whether or not a finitely presented group has a non-trivial finite quotient; indeed, this remains undecidable among the fundamental groups of compact, non-positively curved square…

In this note, we study the notion of random Dehn function and compute an asymptotic upper bound for finitely presented acylindrically hyperbolic groups whose Dehn function is at most polynomial. By showing that in these cases, if the group…

The classification of maximal function fields over a finite field is a difficult open problem, and even determining isomorphism classes among known function fields is challenging in general. We study a particular family of maximal function…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…

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…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

The Equation Problem in finitely presented groups asks if there exists an algorithm which determines in finite amount of time whether any given equation system has a solution or not. We show that the Equation Problem in central extensions…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…