Related papers: Decision problems and profinite completions of gro…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We prove that the profinite completion of the fundamental group of a compact 3-manifold $M$ satisfies a Tits alternative: if a closed subgroup $H$ does not contain a free pro-$p$ subgroup for any $p$, then $H$ is virtually soluble, and…

We continue our investigation of a variation of the group ring isomorphism problem for twisted group algebras. Contrary to previous work, we include cohomology classes which do not contain any cocycle of finite order. This allows us to…

We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.

Can one detect free products of groups via their profinite completions? We answer positively among virtually free groups. More precisely, we prove that a subgroup of a finitely generated virtually free group $G$ is a free factor if and only…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

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…

We define the profinite completion of a C*-algebra, which is a pro-C*-algebra, as well as the pro-C*-algebra of a profinite group. We show that the continuous representations of the pro-C*-algebra of a profinite group correspond to the…

Let $H$ and $K$ be groups. In this paper we introduce a concept of determinant for automorphisms of $H\times K$ and some concepts of incompatibility for group pairs as a measure of how much $H$ and $K$ are fare from being isomorphic. With…

We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup generated by a given set of generators. In particular we consider the identity problem for the special linear group following recent…

We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…

Let $\phi: G \rightarrow H$ be a group homomorphism such that $H$ is a totally disconnected locally compact (t.d.l.c.) group and the image of $\phi$ is dense. We show that all such homomorphisms arise as completions of $G$ with respect to…

A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the…

It is proved that a profinite group $G$ has fewer than $2^{\aleph_0}$ conjugacy classes of $p$-elements for an odd prime $p$ if and only if its $p$-Sylow subgroups are finite. (Here, by a $p$-element one understands an element that either…

Let $G= N\rtimes H$ be a locally compact group which is a semi-direct product of a closed normal subgroup $N$ and a closed subgroup $H.$ The Bohr compactification ${\rm Bohr}(G)$ and the profinite completion ${\rm Prof}(G)$ of $G$ are,…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and…