Papers
Topics
Authors
Recent
Search
2000 character limit reached

Free factors and profinite completions

Published 2 Jul 2022 in math.GR | (2207.00912v3)

Abstract: 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 if its closure in the profinite completion of $G$ is a profinite free factor. This generalises results by Parzanchevski and Puder (later also proved by Wilton) for free groups. Our methods are entirely different to theirs, combining homological properties of profinite groups and the decomposition theory of Dicks and Dunwoody.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.