ePrints

An Algorithmic Approach to Fundamental Groups and Covers of Combinatorial Cell Complexes

Lookup NU author(s): Professor Sarah Rees

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

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. © 2000 Academic Press.

Publication metadata

Author(s): Rees S; Soicher LH

Publication type: Article

Publication status: Published

Journal: Journal of Symbolic Computation

Year: 2000

Volume: 29

Issue: 1

Pages: 59-77

ISSN (print): 0747-7171

ISSN (electronic): 1095-855X

Publisher: Academic Press

URL: http://dx.doi.org/10.1006/jsco.1999.0292

DOI: 10.1006/jsco.1999.0292

Altmetrics

Share