加载中…
Let denote the number of maximal subgroups of of index . An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups (i.e., for $\limsup \frac{\log m_n(G)}{\log n}m_n(G)$). A condition is given for when this upper bound is attained. For , where , it is shown that grows like a polynomial of degree equal to the number of blocks in the rational canonical form of . The leading term of this polynomial is the number of distinct roots (in ) of the characteristic polynomial of the smallest block.

生成讲解博客的中文版本

生成AI智能校验的中文版本