Version 2.38
15/12/2017
Anne Heyworth
Chris Wensley
Email: c.d.wensley@bangor.ac.uk
Homepage: http://pages.bangor.ac.uk/~mas023/
Address:
School of Computer Science, Bangor University,
Dean Street, Bangor, Gwynedd, LL57 1UT, U.K.
The IdRel package was originally implemented in 1999, using the GAP 3 language, when the first author was studying for a Ph.D. in Bangor.
This package is designed to compute a minimal set of generators for the module of the identities among relators 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).
IdRel became an accepted GAP package in May 2015.
Bug reports, suggestions and comments are, of course, welcome. Please submit an issue at https://github.com/gap-packages/idrel/issues/ or send an email to the second author at c.d.wensley@bangor.ac.uk.
© 1999-2017 Anne Heyworth and Chris Wensley
IdRel is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This documentation was prepared with the GAPDoc package [LN12] of Frank Lübeck and Max Neunhöffer.
The procedure used to mount new releases on GitHub uses the packages GitHubPagesForGAP [Hor17] and ReleaseTools of Max Horn.
generated by GAPDoc2HTML