6 citations · 12 across the 4 of their papers we have counts for
4 papers
Most permutations power to a cycle of small prime length
S. P. Glasby, Cheryl E. Praeger, W. R. Unger
We prove that most permutations of degree have some power which is a cycle of prime length approximately . Explicitly, we show that for sufficiently large, the prop…
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…
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…
An algorithm for computing Schur indices of characters
William R. Unger
We describe an algorithm for computing Schur indices of irreducible characters of a finite group , based on computations within and its subgroups and with their character ta…