[Math] How many conjugacy classes of subgroups does GL(2,p) have

finite-groupsgr.group-theory

How many conjugacy classes of subgroups does $\mathrm{GL}(2,p)$ have?

For instance the dihedral group of order $2n$ has $\tau(n)$ cyclic normal subgroups and $\sigma(n)$ "dihedral" subgroups (as in, containing a reflection), but they fall into $\gcd(2,n) \tau(n) + \tau(n/\gcd(2,n))$ conjugacy classes. Here $\tau(n)$ is the number of divisors of $n$, and $\sigma(n)$ is their sum.

The formula is relatively compact and can be explicitly evaluated for $n$ in the millions without much work. The description is nice because it even indicates the structure of the subgroups.

The subgroups of $\mathrm{GL}(2,p)$ whose order is divisible by $p$ either have a normal Sylow $p$-subgroup or contain $\mathrm{SL}(2,p)$. The former types have conjugacy classes indexed by the subgroups of $(p-1) × (p-1)$, and the latter by subgroups of $(p-1)$. The number of the first type has some reasonable formulas at OEIS: A060724 and the latter is just $\tau(p-1)$ again.

Again the description is compact and can be explicitly evaluated for numbers into the millions without any real effort: $\mathrm{GL}(2,1000003)$ has $1000008$ conjugacy classes of subgroups of order divisible by $1000003$ and $\mathrm{GL}(2,10000019)$ has $10000024$ conjugacy classes of subgroups of order divisible by $10000019$, each number computed in under 1ms. Again the description is especially nice because it even indicates the structure of the subgroups.

What about the conjugacy classes of subgroups of $\mathrm{GL}(2,p)$ whose order is coprime to $p$?

Is there a similarly compact and easily evaluated description of their number, and even more nicely, does it also indicate the structure of the subgroups?

Best Answer

This question is reasonably hard, but important. A very clear and explicit answer is given in:

Flannery, D. L.; O'Brien, E. A. "Linear groups of small degree over finite fields." Internat. J. Algebra Comput. 15 (2005), no. 3, MR2151423 doi:10.1142/S0218196705002426

This has applications to primitive, solvable, linear groups of prime-squared degree and many other problems where an explicit knowledge of the subgroups of $\mathrm{GL}(2,q)$ is needed. This takes a fairly different approach from Dickson which is based on the geometric actions of $\mathrm{PSL}(2,\mathbb{C})$, and instead uses a more module-theoretic approach, some of which goes back Suprunenko especially as carried on by Short. The classes of $\mathrm{PGL}(2,q)$ split in somewhat unusual and hard to control ways (I found the dihedrals to be a nightmare), but subgroups of $\mathrm{GL}(2,q)$, like subgroups of $\mathrm{Sym}(n)$, can be classified by their action on the natural space.

This gives a simple formula for the number of conjugacy classes of abelian groups:

  • $(a(q−1)−b(q−1))/2 + b(q−1)$ classes of diagonal subgroups, $a$,$b$ defined below
  • $\tau(q^2−1) − \tau(q−1)$ classes of irreducible, but not absolutely irreducible abelian subgroups (Singer)
  • $\tau(q−1) \log_p q$ classes of indecomposable, but reducible abelian groups (central*unipotent)

Here $a$,$b$ are (weakly) multiplicative functions with values on prime powers:

  • $a(p^e) = (p^{e+2} + p^{e+1} + 1 + 2e − 3p − 2ep) / (p−1)^2$
  • $b(2^e) = 2e^2−2e+3$
  • $b(p^e) = (e+1)^2$, $p$ odd

These functions are fairly natural: $a(n)$ counts the number of subgroups of $\mathbb{Z}/n\mathbb{Z} \times \mathbb{Z}/n\mathbb{Z}$, and $b(n)$ counts the number of those subgroups left invariant by a coordinate swap.

I am still working through the details of the non-abelian groups, but do not foresee any problems. The paper handles $\mathrm{GL}(2,q)$ for $q=p^e$, $p \geq 5$, but for the most part I only need $e=1$, and the omissions in the paper are not too serious even for $p=2,3$.

A reducible subgroup of $\mathrm{GL}(2,q)$ must be abelian, and so the next case are the non-abelian imprimitive groups, all of which must be monomial and so have a clear list of representatives. The primitive linear groups seem to be messier in the details, but as one can more clearly distinguish the "$Z$" from the "$\mathrm{PGL}$" part, Dickson's method appears to just work.