Related papers: Subgroups of finitely presented groups with solvab…

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.

We prove that every verbally closed two-generated subgroup of a free solvable group G of a finite rank is a retract of G.

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

We establish a general criterion for the finite presentability of subdirect products of groups and use this to characterize finitely presented residually free groups. We prove that, for all $n\in\mathbb{N}$, a residually free group is of…

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…

It is known that every finitely presented group is the fundamental group of the total space of a Lefschetz fibration. In this paper, we give another proof which improves the result of Korkmaz. In addition, Korkmaz defined the genus of a…

If G and H are finitely generated, residually nilpotent metabelian groups, H is termed para-G if there is a homomorphism of G into H which induces an isomorphism between the corresponding terms of their lower central quotient groups. We…

For a countable group G = <A | R> presented by its generators A and defining relations R we discuss a simple method to embed G into such a 2-generator group T that the images of generators from A are explicitly given in T, and the defining…

We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of finitely-generated…

We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.

It was recently proven by Esnault, Shusterman and the second named author, that the \'etale fundamental group of a connected smooth projective variety over an algebraically closed field $k$ is finitely presented. In this note, we extend…

Given a short exact sequence of groups with certain conditions, $1\to F\to G\to H\to 1$, we prove that $G$ has solvable conjugacy problem if and only if the corresponding action subgroup $A\leqslant Aut(F)$ is orbit decidable. From this, we…

In this paper, we provide some conditions of (super)-solvability and nilpotency of a finite group $G$ based on its number of subgroups $Sub(G)$. Our results generalize the classification of finite groups with less than $20$ subgroups by…

A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group $G$ has solvable word problem if and only if $G$ can be embedded into a finitely presented simple group. We comment on the history of this conjecture…

This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…

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…

Let $k$ be a field of characteristic $p>0$, which has infinitely many discrete valuations. We show that every finite embedding problem for $\Gal(k)$ with finitely many prescribed local conditions, whose kernel is a $p$-group, is properly…

This paper initiates the study of effective twisted conjugacy separability for finitely generated groups, which measures the complexity of separating distinct twisted conjugacy classes via finite quotients. The focus is on nilpotent groups,…

It is proved that generalized free product of two finite p-groups is a conjugacy p-separable group if and only if it is residually finite p-groups. This result is then applied to establish some sufficient conditions for conjugacy…