Abstract
We study the Modular Isomorphism Problem for groups of small order based on an improvement of an algorithm described by Eick. Our improvement allows to determine quotients I(kG)/I(kG)m of the augmentation ideal without first computing the full augmentation ideal I(kG). Our computations yield a positive answer to the MIP for groups of order 37 and strongly reduce the cases that need to be checked for groups of order 56. We also show that the counterexamples to the Modular Isomorphism Problem found recently by García-Lucas, Margolis and del Río are the only 2- or 3-generated counterexamples of order 29. Furthermore, we provide a proof for an observation of Bagiński, which is helpful in eliminating computationally difficult cases.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.