×

On the cut point conjecture. (English) Zbl 0868.20032

Summary: We sketch a proof of the fact that the Gromov boundary of a hyperbolic group does not have a global cut point if it is connected. This implies, by a theorem of Bestvina and Mess, that the boundary is locally connected if it is connected.

MSC:

20F65 Geometric group theory
57M40 Characterizations of the Euclidean \(3\)-space and the \(3\)-sphere (MSC2010)
53C23 Global geometric and topological methods (à la Gromov); differential geometric analysis on metric spaces
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Mladen Bestvina and Mark Feighn, Bounding the complexity of simplicial group actions on trees, Invent. Math. 103 (1991), no. 3, 449 – 469. · Zbl 0724.20019 · doi:10.1007/BF01239522
[2] Mladen Bestvina and Mark Feighn, Stable actions of groups on real trees, Invent. Math. 121 (1995), no. 2, 287 – 321. · Zbl 0837.20047 · doi:10.1007/BF01884300
[3] Mladen Bestvina and Geoffrey Mess, The boundary of negatively curved groups, J. Amer. Math. Soc. 4 (1991), no. 3, 469 – 481. · Zbl 0767.20014
[4] B. H. Bowditch, Treelike structures arising from continua and convergence groups, Preprint (1995). · Zbl 0961.20034
[5] ——, Boundaries of strongly accessible groups, Preprint (1996).
[6] ——, Group actions on trees and dendrons, Preprint (1995).
[7] ——, Cut points and canonical splittings of hyperbolic groups, Preprint (1995).
[8] W. Grosso, Unpublished manuscript, Berkeley (1995).
[9] G. Levitt, Nonnesting actions on real trees, Preprint (1996).
[10] G. P. Scott and G. A. Swarup, An algebraic annulus theorem, Preprint (1995). · Zbl 0984.20028
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.