The combinatorial structure of cocompact discrete hyperbolic groups (Q1084704): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00146825 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2028978432 / rank | |||
Normal rank |
Latest revision as of 09:23, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The combinatorial structure of cocompact discrete hyperbolic groups |
scientific article |
Statements
The combinatorial structure of cocompact discrete hyperbolic groups (English)
0 references
1984
0 references
Combinatorial group theory began with Dehn's study [\textit{M. Dehn}, Math. Ann. 69, 137-168 (1910); ibid. 71, 116-144 (1912); ibid. 72, 413-420 (1912)] of the fundamental group of the closed 2-dimensional manifold admitting a hyperbolic structure. At first Dehn freely used arguments from hyperbolic geometry, but rapidly he and others moved in the direction of results which could be stated and proved in purely combinatorial and algebraic terms. \textit{W. P. Thurston} [see ''Geometry and topology of 3-manifolds'', Princeton Univ., Notes (1978); ''On the geometry and dynamics of diffeomorphisms of surfaces. I'', preprint] has recently shown that large classes of groups of interest to topologists, while not obviously amenable to attack by standard methods of combinatorial group theory, nevertheless are discrete hyperbolic groups. His result suggests the value of a return to geometric considerations in combinatorial group theory. We show that Dehn's principal combinatorial theorems - in particular his solutions to the word and conjugacy problems for hyperbolic surface groups - have simple geometric reinterpretations, and that these solutions, as reinterpreted, are true for all cocompact, discrete hyperbolic groups. We also show that the global combinatorial structure of such groups is particularly simple in the sense that the Cayley group graphs have descriptions by linear recursion.
0 references
word problem
0 references
Combinatorial group theory
0 references
conjugacy problems
0 references
cocompact, discrete hyperbolic groups
0 references
Cayley group graphs
0 references