Bounding the complexity of simplicial group actions on trees.
Inventiones mathematicae (1991)
- Volume: 103, Issue: 3, page 449-470
- ISSN: 0020-9910; 1432-1297/e
Access Full Article
topHow to cite
topBestvina, Mladen, and Feighn, Mark. "Bounding the complexity of simplicial group actions on trees.." Inventiones mathematicae 103.3 (1991): 449-470. <http://eudml.org/doc/143865>.
@article{Bestvina1991,
author = {Bestvina, Mladen, Feighn, Mark},
journal = {Inventiones mathematicae},
keywords = {simplicial group actions on trees; Grushko's theorem; accessibility theorem; finitely presented group; reduced G-tree; small edge stabilizers; number of vertices},
number = {3},
pages = {449-470},
title = {Bounding the complexity of simplicial group actions on trees.},
url = {http://eudml.org/doc/143865},
volume = {103},
year = {1991},
}
TY - JOUR
AU - Bestvina, Mladen
AU - Feighn, Mark
TI - Bounding the complexity of simplicial group actions on trees.
JO - Inventiones mathematicae
PY - 1991
VL - 103
IS - 3
SP - 449
EP - 470
KW - simplicial group actions on trees; Grushko's theorem; accessibility theorem; finitely presented group; reduced G-tree; small edge stabilizers; number of vertices
UR - http://eudml.org/doc/143865
ER -
Citations in EuDML Documents
top- Zlil Sela, Diophantine geometry over groups I : Makanin-Razborov diagrams
- Thomas Delzant, Sur l'accessibilité acylindrique des groupes de présentation finie
- Damien Gaboriau, Gilbert Levitt, The rank of actions on -trees
- Frédéric Paulin, Sur la théorie élémentaire des groupes libres
- Vincent Guirardel, Dynamics of out on the boundary of outer space
- Michael Kapovich, Bruce Kleiner, Hyperbolic groups with low-dimensional boundary
- François Dahmani, Daniel Groves, The isomorphism problem for toral relatively hyperbolic groups
- Vincent Guirardel, Actions of finitely generated groups on -trees
- Frédéric Paulin, Actions de groupes sur les arbres
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.