2000 character limit reached
Essential surfaces in graph pairs (1701.02505v3)
Published 10 Jan 2017 in math.GR and math.GT
Abstract: A well known question of Gromov asks whether every one-ended hyperbolic group $\Gamma$ has a surface subgroup. We give a positive answer when $\Gamma$ is the fundamental group of a graph of free groups with cyclic edge groups. As a result, Gromov's question is reduced (modulo a technical assumption on 2-torsion) to the case when $\Gamma$ is rigid. We also find surface subgroups in limit groups. It follows that a limit group with the same profinite completion as a free group must in fact be free, which answers a question of Remeslennikov in this case.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.