求p-群的中心分解
Finding central decompositions of p-groups
摘要：
给出了求2类有限p-群和2类幂零李环的最大尺寸中心分解的多项式时间算法。该算法使用Las Vegas概率例程来计算有限 *-环的结构以及Las Vegas C-MeatAxe。当p较小时，概率方法可以被确定性多项式时间算法所取代。该方法引入了新的群同构不变量，包括新的特征子群。
英文摘要：
Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of finite *-rings and also the Las Vegas C-MeatAxe. When p is small, the probabilistic methods can be replaced by deterministic polynomial-time algorithms. The methods introduce new group isomorphism invariants including new characteristic subgroups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
