IdRel

Authors: Anne Heyworth, Chris Wensley
Language: GAP 4.4
Operating System: Any
Current version: 2.06 (21/07/2011)
README file: README
HTML: doc/chap0.html

Description

This package is designed to compute a minimal set of generators for the module of the identities among relations of a group presentation. It does this using

rewriting and logged rewriting: a self-contained implementation of the Knuth-Bendix process using the monoid presentation associated to the group presentation;
monoid polynomials: an implementation of the monoid ring;
module polynomials: an implementation of the right module over this monoid generated by the relators.
Y-sequences: used as a rewriting way of representing elements of a free crossed module (products of conjugates of group relators and inverse relators).

Manual

Choose from the following formats:

HTML, Index.
PDF (216 KB).

Authors

Anne Heyworth,

Chris Wensley,
School of Computer Science, Bangor University,
Bangor, Gwynedd, LL57 1UT

email: anne.heyworth@googlemail.com and c.d.wensley@bangor.ac.uk

(idrel206.html, version 21/07/11)