✦ LIBER ✦
An Algorithmic Approach to Fundamental Groups and Covers of Combinatorial Cell Complexes
✍ Scribed by Sarah Rees; Leonard H. Soicher
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 341 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
✦ Synopsis
We first develop a construction, originally due to Reidemeister, of the fundamental group and covers of a two-dimensional combinatorial cell complex. Then, we describe a practical algorithmic approach to the computation of fundamental groups and first homology groups (as finitely presented groups), of first homology groups mod p (as vector spaces), of deck groups (as permutation groups), and of covers of finite simple such complexes. In the case of clique complexes of finite simple graphs, the algorithms described have been implemented in GAP, making use of the GRAPE package.