# Number of prime factors of the order of a finite non-abelian simple group

Hi everybody!

I am looking for results about how to bound from above the number of prime factors of the order of a non-abelian simple group $S$ in terms of, say, the index of a subgroup of $S$. I call $\omega(x)$ the number of prime factors of the integer $x$. For alternating groups everything is very simple, and we clearly have $\omega(|A_n|) \leq n$ (even better, but this is ok). Do you know results in this direction about the other simple groups? In particular I have two questions:

1) Let $S$ be a non-abelian simple group, and let $m(S)$ be the minimum index of a proper subgroup of $S$. Is it true that $\omega(|S|) \leq m(S)$?

2) Does there exist a sequence $\{S(n)\}_n$ of non-abelian simple groups such that $|S(n)|$ goes to infinity and $\{\omega(|S(n)|)\}_n$ is bounded?

-
Thank you, sorry, the first question was easy...! About the second one, I am looking for a sequence $(S(n))_n$ of non-abelian simple groups (if it exists) such that the orders $|S(n)|$ go to infinity and the number of prime factors remains bounded, i.e. the sequence $(\omega(|S(n)|))_n$ is bounded. I think that the question is clear... Sorry again for the first question. – Martino Garonzi Jun 13 '11 at 16:19
As for 2), the orders of finite simple groups are known, see en.wikipedia.org/wiki/List_of_finite_simple_groups . A typical expression for the infinite families is a product like $q^6(q^6−1)(q^2−1)$, where $q$ is a prime power (this particular expression is for $G_2(q)$). I don't know how to answer your question based on this information, though. – Emil Jeřábek Jun 13 '11 at 17:23

To help searching: ω(|G|) = |π(G)|, and I see the latter usually.

A finite simple group G with |π(G)| = 1 must be cyclic of order p. By Burnside's paqb theorem, if |π(G)|=2, then G is not simple.

The finite simple groups with |π(G)| = 3 were handled in several specific cases are handled by Brauer, Herzog, Klinger, Leon, Mason, Thompson, and Wales. In particular, it is now known any such group is one of the eight groups listed by Leon–Wales (1974), but this was not known as late as 1976. An important technique is to consider the list of minimal simple non-abelian groups as classified by Thompson in his N-groups papers. This narrowed the problem down to {2,3,p}-groups, and indeed p had only a few possibilities. Brauer, Leon, and Wales applied character theoretic techniques to classify such groups, and Klinger, Mason, and Thompson used local group-theoretic methods.

The finite simple groups with |π(G)| = 4 may have been classified by Cao. With the benefit of the classification, one has explicit order formulas for each finite simple group. Unfortunately, the prime factorizations of these formulas can be very difficult to understand. From the review of Bugeaud–Cao–Mignotte (2001), it appears that we probably have the complete list of groups, but that we may not have the proof of this in my lifetime (just due to silly things like Fermat and Mersenne primes).

In particular, I believe that it is not yet proven that there are only finitely many groups with |π(G)| = 4.

I would guess that effectively the answer to your 2nd question then is:

No there is no such sequence, but we cannot yet prove this due to number theory problems.

Edit: Just to be fickle, let me mention another open problem in that intersection of finite simple groups and number theory. Solomon (2001) attributes this to Peter Neumann:

Are there infinitely many primes p such that |PSL(2, p)| is a product of six primes? (probably?)

My goodness there are a lot of them! 4721 up to |G| ≤ 1020. Two of the primes have to be 2, one has to be 3, but the other three are sort of like "triplet primes", since they need to divide p−1, p, and p+1. The analogy is a little loose, since we divide (p−1)(p+1) by 24. The twin prime conjecture is still open, and Solomon describes these problems as "difficult and irrelevant obstacles" for understanding finite simple groups.

I include a selection of papers. I think you get a flavor for the results from these, but there are several I left out, just because the list was getting long.

-
(Thanks to Vipul Naik's page for bringing the article of Solomon to my attention.) – Jack Schmidt Jun 19 '11 at 3:16

Let $F(x) \in \mathbf{Z}[x]$ be a non-constant polynomial. It's a standard fact in Sieving theory that there are infinitely many primes $p$ such that $F(p)$ has at most $r$-prime factors for some $r$ depending on $F(x)$. Moreover, given $F(x)$ one may compute explicitly a suitable $r$. In particular, the groups $\mathrm{PSL}(\mathbf{F}_p)$ will have order divisible by at most (say) $50$ primes for infinitely many $p$. The remark alluded to in the previous answer regarding "difficult number theory problems" only concerns finding the optimal value of $r$, which does lead to twin-prime like problems.

You can find such theorems in Ch.X of Halberstam and Richert's book, with the caveat that the statements there will probably assume that the values of $F(n)$ for $n \in \mathbf{Z}$ are not all divisible by a fixed prime $p$ (which is not true of $x^3 - x$ because of $p = 2$), but the arguments can easily be adapted to account for this.

-