Star-complexes, and the dependence problems for hyperbolic complexes (Q4734012)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4120394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Star-complexes, and the dependence problems for hyperbolic complexes |
scientific article; zbMATH DE number 4120394 |
Statements
Star-complexes, and the dependence problems for hyperbolic complexes (English)
0 references
1988
0 references
presentation
0 references
mappings of 2-complexes
0 references
star-complexes
0 references
strong mappings
0 references
coverings
0 references
finite hyperbolic complexes
0 references
dependence problem
0 references
word problem
0 references
conjugacy problem
0 references
0 references
0.72387624
0 references
0.7224114
0 references
0.7138322
0 references
0.71112597
0 references
Given a group presentation (or more generally a 2-complex) one can associate with it an object which has variously been called co-initial graph, star-graph, star-complex, and which has proved useful in several contexts. For certain mappings of 2-complexes \(\phi\) : \(K\to L\) (``strong mappings'') one gets an induced mapping \(\phi^{st}: K^{st}\to L^{st}\) of the associated star-complexes. Then \(^{st}\) is a covariant functor from the category of 2-complexes (where the morphisms are strong mappings) to the category of 1-complexes, and this functor behaves very nicely with respect to coverings (Theorem 1). Hyperbolic complexes arise when one considers assigning numbers (``weights'') to the edges of the star-complex of a 2-complex in such a way that certain conditions are satisfied. \textit{S. M. Gersten} proved that finite hyperbolic complexes have solvable word and conjugacy problems [in: Essays in Group Theory, Publ., Math. Sci. Res. Inst. 8, 15- 73 (1987; Zbl 0644.20024)]. In this paper we give a simpler proof of a much more general result. If K is a 2-complex and n is a positive integer we define a decision problem which we call the dependence problem DP(n) for K. (The word problem is DP(1) and the conjugacy problem is DP(2).) We show that if K is a finite hyperbolic complex then DP(n) is solvable for all n (Theorem 2). (Actually, we prove a somewhat stronger result, namely that the ``union'' DP(\(\infty)\) of all the problems DP(n) is solvable.) The paper also contains other information relating to hyperbolic 2- complexes. We remark that concepts of hyperbolicity in group theory are discussed in great detail by \textit{M. Gromov} [ibid. 75-263 (1987; Zbl 0634.20015)].
0 references