On the intersection of tame subgroups in groups acting on trees
Abstract
Let G be a group acting on a tree T with finite edge stabilizers of bounded order. We provide, in some very interesting cases, upper bounds for the complexity of the intersection H K of two tame subgroups H and K of G in terms of the complexities of H and K. In particular, we obtain bounds for the Kurosh rank Kr(H K) of the intersection in terms of Kurosh ranks Kr(H) and Kr(K), in the case where H and K act freely on the edges of T.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.