Arithmetic in Group Extensions
Group Theory
2025-09-25 v3
Abstract
We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and matrix representations. We illustrate the use of such representations by constructing a maximal subgroup of the sporadic monster group and calculating its -- hitherto unknown -- character table.
Cite
@article{arxiv.2412.06218,
title = {Arithmetic in Group Extensions},
author = {Alexander Hulpke},
journal= {arXiv preprint arXiv:2412.06218},
year = {2025}
}