The Modular Isomorphism Problem for small groups – revisiting Eick's algorithm
Journal of Computational Algebra · 2022
DOI: 10.1016/j.jaca.2022.100001 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computational Algebra, 2022. Verfasst von Leo Margolis und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: VUB University, Ministerio de Ciencia e Innovación, Fonds Wetenschappelijk Onderzoek.
Abstract (Originalsprache)
We study the Modular Isomorphism Problem (MIP) for groups of small order based on an improved implementation of an algorithm developed by B. Eick. This improvement allows to determine quotients $I(kG)/I(kG)^n$ of the augmentation ideal without first computing the full augmentation ideal $I(kG)$. Being more time and memory efficient it allows us to verify that the MIP has a positive answer for groups of order $3^7$ and to significantly reduce the cases that need to be checked for groups of order $5^6$.
Förderung
- VUB University
- Ministerio de Ciencia e Innovación
- Fonds Wetenschappelijk Onderzoek
- CSIC General Foundation
Zitieren
APA
Margolis, L., & Moede, T. (2022). The Modular Isomorphism Problem for small groups – revisiting Eick's algorithm. Journal of Computational Algebra. https://doi.org/10.1016/j.jaca.2022.100001
Vancouver
Margolis L, Moede T. The Modular Isomorphism Problem for small groups – revisiting Eick's algorithm. Journal of Computational Algebra. 2022. doi:10.1016/j.jaca.2022.100001
BibTeX
@article{Margolis2022,
author = {Margolis, Leo and Moede, Tobias},
title = {The Modular Isomorphism Problem for small groups – revisiting Eick's algorithm},
journal = {Journal of Computational Algebra},
year = {2022},
doi = {10.1016/j.jaca.2022.100001}
}
EUVIMED