We show that if G is a finite group then no chain of modular elements in its
subgroup lattice L(G) is longer than a chief series. Also, we show that if G is
a nonsolvable finite group then every maximal chain in L(G) has length at least
two more than that of the chief length of G, thereby providing a converse of a
result of J. Kohler.
It is shown that a refined version of a q-analogue of the Eulerian numbers
together with the action, by conjugation, of the subgroup of the symmetric
group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations
of fixed cycle type and fixed number of excedances provides an instance of the
cyclic sieving phenonmenon of Reiner, Stanton and White. The main tool is a
class of symmetric functions recently introduced in work of two of the authors.