Decision problems and profinite completions of groups

Details Decision problems and profinite completions of groups Decision problems and profinite completions of groups

2008-10-02

arxiv.org/abs/0810.0390v1

Mathematics

Group Theory

Scientific paper

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary such pair, can determine whether or not $P$ is isomorphic to $\G$. We construct pairs for which the conjugacy problem in $\G$ can be solved in quadratic time but the conjugacy problem in $P$ is unsolvable. Let $\mathcal J$ be the class of super-perfect groups that have a compact classifying space and no proper subgroups of finite index. We prove that there does not exist an algorithm that, given a finite presentation of a group $\G$ and a guarantee that $\G\in\mathcal J$, can determine whether or not $\G\cong\{1\}$. We construct a finitely presented acyclic group $\H$ and an integer $k$ such that there is no algorithm that can determine which $k$-generator subgroups of $\H$ are perfect.

Affiliated with

Also associated with

No associations

Rating

Decision problems and profinite completions of groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decision problems and profinite completions of groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decision problems and profinite completions of groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492294