有限群中不同合成列数量的上界及群同构中的极端行为
An Upper Bound on the Number of Distinct Composition Series in Finite Groups and Extremal Behavior in Group Isomorphism
AI总结:
该研究证明了阶≤n的有限群中不同合成列数量的严格上界,确定等号成立的群类型,分析其渐近增长,并探讨对群同构问题相关方法的意义。
摘要:
我们证明,在所有阶≤n(n≥4)的有限群中,不同合成列的数量上界为∏(i=1到⌊log₂n⌋)(2ⁱ−1),等号成立当且仅当G是阶为2^α的初等阿贝尔2-群,其中α=⌊log₂n⌋。该界为有限群中合成列计数提供了严格最优上界。此外,我们研究该界的极端渐近增长,证明其为n^(½log₂n + O(1)),并考察其对基于合成列的群同构问题方法的直接意义。
英文摘要:
We prove that among all finite groups of order $\le n$ (where $n \ge 4$), the number of distinct composition series is bounded above by $\prod_{i=1}^{\lfloor \log_2 n \rfloor} (2^i - 1)$, with equality holding if and only if $G$ is the elementary abelian $2$-group of order $2^α$, where $α= \lfloor \log_2 n \rfloor$. This bound provides a sharp, optimal upper bound for composition series enumeration in finite groups. Furthermore, we study the extremal asymptotic growth of this bound, proving it to be $n^{\frac{1}{2}\log_2 n + O(1)}$, and examine its direct implications for composition-series-based approaches to the group isomorphism problem
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。