The Gpd package provides functions for computation with finite groupoids and their morphisms.
The first part is concerned with the standard constructions for connected groupoids, and for groupoids with more than one component. Groupoid morphisms are also implemented.
The second part implements graphs of groups and graphs of groupoids.
A graph of groups is a directed graph with a group at each vertex
and with isomorphisms between subgroups on each arc.
This construction enables normal form computations for
free products with amalgamation, and for HNN extensions,
when the vertex groups come with their own rewriting systems.
For further information, see Emma Moore's Ph.D. thesis: moore.ps.gz
Computationally, there are three types of connected groupoid:
Choose from the following formats:
Emma Moore
email: emmajmoore@yahoo.co.uk
Chris Wensley
School of Computer Science
University of Wales
Bangor, Gwynedd
LL57 1UT, UK
email: c.d.wensley@bangor.ac.uk
| [Home] | | | [About GAP] | | | [Support] | | | [Get GAP] | | | [Miscellanea] | | |
(gpd103.html, version 08/10/07)