2000 character limit reached
Strongly Quasiconvex subgroups in graphs of groups (2204.09242v1)
Published 20 Apr 2022 in math.GR
Abstract: Given a graph of groups $\mathcal{G} = (\Gamma, {G_v}, {G_e})$ with certain conditions on vertex groups and $G$ acts acylindrically on its Bass-Serre tree $T$. Let $H$ be a finitely generated subgroup of $G$. We prove the following statements equivalence: $H$ has finite height, $(G, T, H)$ is a $A/QI$--triple, $H$ is strongly quasiconvex and virtually free in $G$. We also give a condition to determine whether strong quasiconvexity in a group is preserved under amalgams.
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.