Goto Chapter: Top 1 2 3 4 Bib Ind
 [Top of Book]  [Contents]   [Next Chapter] 

LiePRing

Database and algorithms for Lie p-rings

2.9.3

18 August 2026

Bettina Eick
Email: beick@tu-bs.de
Homepage: http://www.iaa.tu-bs.de/beick

Michael Vaughan-Lee
Email: michael.vaughan-lee@chch.ox.ac.uk
Homepage: http://users.ox.ac.uk/~vlee

Abstract

LiePRing gives access to the database of Lie p-rings of order at most p^7 as determined by Mike Newman, Eamonn O'Brien and Michael Vaughan-Lee, see [NOV03] and [OV05], and it provides some functionality to work with these Lie p-rings.

If you use LiePRing, then please cite it as: Bettina Eick and Michael Vaughan-Lee, LiePRing -- A GAP Package for computing with nilpotent Lie rings of prime-power order (2014), see https://www.gap-system.org/Packages/liepring.html

Copyright

LiePRing is free software; you can redistribute 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. LiePRing is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

Acknowledgements

The Lazard correspondence induces a one-to-one correspondence between the Lie p-rings of order p^n and class less than p and the p-groups of order p^n and class less than p. LiePRing provides a function to evaluate this correspondence; this function has been implemented and given to us by Willem de Graaf.

Contents

1 Lie p-rings
2 LiePRings in GAP
3 The Database
4 Advanced functions for Lie p-rings
References
Index

 [Top of Book]  [Contents]   [Next Chapter] 
Goto Chapter: Top 1 2 3 4 Bib Ind

generated by GAPDoc2HTML