2 papers
math.GR2019
Fast detection of giant permutation groups
William R. Unger
We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard me…
math.GR2019
Almost all permutations power to a cycle of prime length
William R. Unger
We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the…