pith. sign in

arxiv: 1807.03423 · v1 · pith:64Y5UB7Cnew · submitted 2018-07-09 · 🧮 math.GR

Maximal subgroup growth of some metabelian groups

classification 🧮 math.GR
keywords mathbbpolynomialdegreegrowthmaximalnumberboundgiven
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.