Related papers: Subgroups of finitely presented groups with solvab…

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

We prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…

We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…

We show that every finitely generated nilpotent group of class 2 occurs as the quotient of a finitely presented abelian-by-nilpotent group by its largest nilpotent normal subgroup.

An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.

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,…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

It is proved that all finitely generated subgroups of generalized free product of two groups are finitely separable provided that free factors have this property and amalgamated subgroups are normal in corresponding factors and satisfy the…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.

In this paper we show that the membership problems for finitely generated submonoids and for rational subsets are recursively equivalent for groups with two or more ends.

In this paper, we show that each finite group $G$ containing at most $p^2$ Sylow $p$-subgroups for each odd prime number $p$, is a solvable group. In fact, we give a positive answer to the conjecture in \cite{Rob}.

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

We prove the pro-supersolvable closure of a finitely generated subgroup of the free group is finitely generated. It extends similar results for pro-$p$ closures proved by Ribes-Zalesskii and pro-Nilpotent closures proved by…

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…

Let $G$ be a finite group and assume $p$ is a prime dividing the order of $G$. Suppose for any such $p$, that every two abelian $p$-subgroups of $G$ of equal order are conjugate. The structure of such a group $G$ has been settled in this…

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…

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…

In this note we prove that every finite collection of connected algebraic subgroups of the group of triangular automorphisms of the affine space generates a connected solvable algebraic subgroup.

We prove that every finite semigroup embeds in a finitely presented congruence-free monoid, and pose some questions around the Boone-Higman Conjecture.