Related papers: Decision problems and profinite completions of gro…

Let $\C$ be a variety of finite groups. We use profinite Bass--Serre theory to show that if $u:H\hookrightarrow G$ is a map of finitely generated residually $\C$ groups such that the induced map $\hat{u}:\hat{H}\rightarrow\hat{G}$ is a…

For $S=S_{g,n}$ a closed orientable differentiable surface of genus $g$ from which $n$ points have been removed, such that $\chi(S)=2-2g-n<0$, let $\mathrm{P}\Gamma(S)$ be the pure mapping class group of $S$ and…

We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic morphism f with an infinite postcritical orbit over a field of characteristic different from two. This is a…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

The paper follows two interconnected directions. 1. Let $G$ be a Roelcke precompact closed subgroup of the group $\Sym(\omega)$ of permutations of the natural numbers. Then $\Inn(G)$ is closed in $\Aut(G)$, where $\Aut(G)$ carries the…

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…

Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…

Let $G$ be a finite group, $\Z G$ the integral group ring of $G$ and $\U(\Z G)$ the group of units of $\Z G$. The Congruence Subgroup Problem for $\U(\Z G)$ is the problem of deciding if every subgroup of finite index of $\U(\Z G)$ contains…

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 construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

We exhibit examples of finitely presented subgroups $P$ of direct products of hyperbolic groups for which there is no algorithm that detects whether a finitely presented group has a quotient isomorphic to $P$. For any torsion-free, linear,…

We determine the permutation groups $P_{\mathrm{comp}}(\mathbb{F}_q),P_{\mathrm{orth}}(\mathbb{F}_q)\leq\operatorname{Sym}(\mathbb{F}_q)$ generated by the complete mappings, respectively the orthomorphisms, of the finite field…

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…

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…

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.

We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism,…

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

We study the conjugacy problem in cyclic extensions of free groups. It is shown that the conjugacy problem is solvable in split extensions of finitely generated free groups by virtually inner automorphisms. An algorithm for construction of…