Arithmetic in Group Extensions
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914053140512768 |
|---|---|
| author | Hulpke, Alexander |
| author_facet | Hulpke, Alexander |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06218 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Arithmetic in Group Extensions Hulpke, Alexander Group Theory 20-08, 20D08 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. |
| title | Arithmetic in Group Extensions |
| topic | Group Theory 20-08, 20D08 |
| url | https://arxiv.org/abs/2412.06218 |