Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The boundary of the free splitting graph and the free factor graph (1211.1630v5)

Published 7 Nov 2012 in math.GT

Abstract: We show that the Gromov boundary of the free factor graph for the free group Fn with n>2 generators is the space of equivalence classes of minimal very small indecomposable projective Fn-trees without point stabilizer containing a free factor equipped with a quotient topology. Here two such trees are equivalent if the union of their metric completions with their Gromov boundaries are Fn-equivariantly homeomorphic with respect to the observer's topology. The boundary of the cyclic splitting graph is the space of equivalence classes of trees which either are indecomposable or split as very large graph of actions. The boundary of the free splitting graph is the space of equivalence classes of trees which either are indecomposable or split as large graph of actions.

Summary

We haven't generated a summary for this paper yet.