The number of conjugacy classes in $S\_n$ is given by the number of partitions of $n$. Do other families of finite groups have a highly combinatorial structure to their number of conjugacy classes? For example, how much is known about conjugacy classes in $A\_n$?



Combinatorial Techniques for Counting Conjugacy Classes
Since $A\_n$ has index two in $S\_n$, every conjugacy class in $S\_n$ either is a conjugacy class in $A\_n$, or it splits into two conjugacy classes, or it misses $A\_n$ if it is an odd permutation. Which happens when is a nice undergraduate exercise in group theory. (And you are a nice undergraduate. :-) )


The pair $A\_n \subset S\_n$ is typical for this question in finite group theory. You want the conjugacy classes of a finite simple group $G$, but the answer is a little simpler for a slightly larger group $G'$ that involves $G$. Another example is $\text{GL}(n,q)$. It involves the finite simple group $L(n,q)$, but the conjugacy classes are easier to describe in $\text{GL}(n,q)$ . They are described by their Jordan canonical form, with the twist that you may have to pass to a field extension of $\mathbb{F}\_q$ to obtain the eigenvalues.


The group $\text{GL}(n,q)$ is even more typical. It is a Chevallay group, which means a finite group analogue of a Lie group. All of the infinite sequences of finite simple groups other than $A\_n$ and $C\_p$ are Chevallay groups. You expect a canonical form that looks something like Jordan canonical form, although it can be rather more complicated.


If $G$ is far from simple, i.e., if it has some interesting composition series, then one approach to its conjugacy classes is to chase them down from the conjugacy classes of its composition factors, together with the structure of the extensions. The answer doesn't have to be very tidy.


I suppose that finite Coxeter groups give you some exceptions where you do get a tidier answer, just because they all resemble $S\_n$ to varying degrees. But I don't know a crisp answer to all cases of this side question. The infinite sequences of finite Coxeter groups consist only of permutation groups, signed permutation groups, and dihedral groups. (And Cartesian products of these.) In the case of signed permutation groups, the answer looks just like $S\_n$, except that cycles can also have odd or even total sign. There is also the type $D\_n$ Coxeter group of signed permutation matrices with an even number of minus signs; the answer is just slightly different from all of the signed permutation matrices, which is type $B\_n$. The crisp answer that I don't have would be a uniform description that includes the exceptional finite Coxeter groups, such as $E\_8$.


