Length Function Compatibility for Group Actions on Real Trees
Abstract
Let be a finitely generated group. Given two length functions and of irreducible actions on real trees and , when is the point-wise sum again the length function of an irreducible action on a real tree? Guirardel and Levitt showed that additivity is equivalent to the existence of a common refinement of and , this equivalence is established using Guirardel's core. Moreover, in this case the sum is the length function of the common refinement of and 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.
Cite
@article{arxiv.1708.07078,
title = {Length Function Compatibility for Group Actions on Real Trees},
author = {Edgar A. Bering},
journal= {arXiv preprint arXiv:1708.07078},
year = {2021}
}
Comments
17 pages, 6 figures, results part of the author's Ph. D. thesis. Revised version containing only the results that are not found in the appendix to arXiv:1602.05139