Related papers: Algorithmic recognition of infinite cyclic extensi…

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…

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…

We prove that the conjugacy problem in Out(Fm) is solvable for the class of outer automorphisms whose restrictions to their polynomial subgroups are of finite order. To do this, we first investigate the structure of suspensions of free…

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 introduce separability properties corresponding to generalized versions of the conjugacy, twisted conjugacy, Brinkmann and Brinkmann's conjugacy problems and how they relate when finite and cyclic extensions of groups are taken. In…

In this note we give a negative answer to Abraham Robinson's question whether a finitely generated extension of an undecidable field is always undecidable. We construct 'natural' undecidable fields of transcendence degree 1 over Q all of…

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

Let $G$ be a finitely generated group that can be written as an extension \[ 1 \longrightarrow K \stackrel{i}{\longrightarrow} G \stackrel{f}{\longrightarrow} \Gamma \longrightarrow 1 \] where $K$ is a finitely generated group. By a study…

We prove that the finiteness of a finitely generated category of irreducible algebraic varieties over a field of characteristic zero is decidable. We also obtain a Burnside finiteness criterion for such a category, with applications to…

A central conjecture in inverse Galois theory, proposed by D\`{e}bes and Deschamps, asserts that every finite split embedding problem over an arbitrary field can be regularly solved. We give an unconditional proof of a consequence of this…

We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of…

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

We consider classes of fundamental groups of complements of various kinds of codimension 2 embeddings and show that, in general, the problem of deciding whether or not a group in one class belongs to a smaller class is algorithmically…

We classify by numerical invariants the finite subgroups $H$ of a primary abelian group $G$ for which every homomorphism or monomorphism of $H$ into $G$, or every endomorphism of $H$, extends to an endomorphism of $G$. We apply these…

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

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 introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

We study the inverse Galois problem with local conditions. In particular, we ask whether every finite group occurs as the Galois group of a Galois extension of $\mathbb{Q}$ all of whose decomposition groups are cyclic (resp., abelian). This…