Bounding the complexity of simplicial group actions on trees (Q2644763): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Some remarks on group actions on trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4028719 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Group Actions On R-Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The accessibility of finitely presented groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the finiteness of higher knot sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3856928 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3341041 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topology of finite graphs / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2058883473 / rank | |||
Normal rank |
Latest revision as of 09:53, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounding the complexity of simplicial group actions on trees |
scientific article |
Statements
Bounding the complexity of simplicial group actions on trees (English)
0 references
1991
0 references
The main result of the paper is the following extension of \textit{M. J. Dunwoody's} accessibility theorem [see Invent. Math. 81, 449-457 (1985; Zbl 0572.20025)]: Theorem. Let G be a finitely presented group. Then there exists an integer \(\gamma\) (G) such that the following holds: If T is a reduced G-tree with small edge stabilizers, then the number of vertices in T/G is bounded by \(\gamma\) (G). Here a finitely generated group E is small if it does not admit a hyperbolic action on any minimal E-tree. This corresponds to Dunwoody's condition on edge stabilizers to be either finite or, for a knot group G, infinite cyclic. The theorem fails if G is only required to be finitely generated - see the authors [Proc. Arboreal Group Theory Conf. 1988, Publ., Math. Sci. Res. Inst. 19, 133-141 (1991)].
0 references
simplicial group actions on trees
0 references
Grushko's theorem
0 references
accessibility theorem
0 references
finitely presented group
0 references
reduced G-tree
0 references
small edge stabilizers
0 references
number of vertices
0 references