ABSTRACT
In a previous paper, the author classified the pairs (G,α) where G is a finite group and α an automorphism of G having a cycle of length greater than . In this paper, we extend this classification to the case where α has a cycle of length equal to
and show some applications of the classification: We discuss an algorithm for listing the pairs (G,α) where the largest cycle length of α equals ρ|G| on input any rational
, and we prove that the set of cycle length fractions of finite group automorphisms is not dense in [0,1].
Acknowledgements
The author would like to thank Peter Hellekalek, Harald Niederreiter, Alina Ostafe and Igor Shparlinski for their many helpful comments.