Related papers: Conjugacy problem in groups with quadratic Dehn fu…

We give a new proof of Quillen's conjecture for solvable groups via a geometric and explicit method. For p-solvable groups, we provide both a new proof using the Classification of Finite Simple Groups and an asymptotic version without…

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…

We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in…

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…

Let ${\cal C}$ be a nonempty class of finite groups closed under taking subgroups, homomorphic images and extensions. A subgroup $H$ of an abstract residually ${\cal C}$ group $R$ is said to be conjugacy ${\cal C}$-distinguished if whenever…

In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids $u,v\in B_n$ and an automorphism $\phi \in Aut (B_n)$, decides whether $v=(\phi (x))^{-1}ux$ for some $x\in B_n$. As…

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…

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 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.

If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…

We prove that a finitely generated solvable group which is not virtually nilpotent has exponential conjugacy growth.

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 present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

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…

A natural question for groups $H$ is which data can be detected in its finite quotients. A subset $X \subset H$ is called separable if for all $h\in H \setminus X$, there exists an epimorphism $\varphi$ to a finite group $Q$ such that…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.

A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.