小群的模同构问题--再谈Eick算法
The Modular Isomorphism Problem for small groups -- revisiting Eick's algorithm
摘要:
本文在改进B.真恶心我们的改进允许在不首先计算完整的增强理想$I(kG)$的情况下确定增强理想的导数$I(kG)/I(kG)^m$。它允许我们验证MIP对于阶数为$3^7$的组具有肯定答案,并且显著减少需要检查阶数为$5^6$的组的情况。我们进一步提供了一个证据的观察Bagienski和提供一个否定的答案的问题Bleher,Kimmerle,Roggenkamp和Wursthorn。
英文摘要:
We study the Modular Isomorphism Problem (MIP) for groups of small order based on an improvement of an algorithm described by B. 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)$. 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$. We further provide a proof for an observation of Bagiński and provide a negative answer to a question of Bleher, Kimmerle, Roggenkamp and Wursthorn.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。