University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Detecting Free Products and Free Factors in Profinite Completions

Detecting Free Products and Free Factors in Profinite Completions

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

OGGW01 - Discrete and profinite groups

Let \( \mathcal{C} \) be a class of groups. We say that \textbf{profinite completions detect free products} in \( \mathcal{C} \) if every finitely generated residually finite group \( G \in \mathcal{C} \), whose profinite completion \( \widehat{G} \) decomposes as \( \widehat{G} = L \amalg K \) with non-trivial \( L \) and \( K \), also decomposes as a free product \( G = H U \) with non-trivial subgroups \( H \) and \( U \). We also say that \textbf{profinite completions detect free factors} in \( \mathcal{C} \) if, for every finitely generated residually finite group \( G \in \mathcal{C} \) with a finitely generated subgroup \( H \), such that the profinite completion \( \widehat{G} \) decomposes as \( \widehat{G} = \overline{H} \amalg K \), there exists a subgroup \( U \leq G \) such that \( G = H U \). I will discuss this property in the class of fundamental groups of graphs of virtually free groups with virtually cyclic edge groups. The talk is based on work in progress with Henrique Souza and Pavel Zalesski.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity