Length Function Compatibility for Group Actions on Real Trees
Abstract
Let G be a finitely generated group. Given two length functions and m of irreducible G actions on real trees A and B, when is the point-wise sum + m again the length function of an irreducible G action on a real tree? Guirardel and Levitt showed that additivity is equivalent to the existence of a common refinement of A and B, this equivalence is established using Guirardel's core. Moreover, in this case the sum + m is the length function of the common refinement of A and B given explicitly by the Guirardel core. The core can be difficult to compute in general. Behrstock, Bestvina, and Clay give an algorithm for computing the core for free group actions on simplicial trees. In this article we give a geometric characterization of existence of a common refinement that generalizes the criterion underlying Behrstock, Bestvina, and Clay's algorithm, as well as two equivalent characterizations in terms of the associated translation length functions.
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.