Charles R. Leedham-Green
Charles R. Leedham-Green has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Alice C. Niemeyer
RWTH Aachen University Germany
2 shared publications - Cheryl E. Praeger
The University of Western Australia
2 shared publications - Robert M. Beals
IDA Center for Communications Research, Princeton, NJ 08540, USA
2 shared publications - Ákos Seress
The University of Western Australia
2 shared publications
Latest Publications
- 1 October 2005
- Published by Elsevier in Journal of Algebra
- Vol. 292 (1) , 4-46
Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules
- 1 October 2005
- Published by Elsevier in Journal of Algebra
- Vol. 292 (1) , 4-46
Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules
- 1 September 2002
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 11 (5) , 447-464
Permutations with Restricted Cycle Structure and an Algorithmic Application
Let q be an integer with q [ges ] 2. We give a new proof of a result of Erdös and Turán determining the proportion of elements of the finite symmetric group Sn having no cycle of length a multiple of q. We then extend our methods to the more difficult case of obtaining the proportion of such elements in the finite alternating group An. In both cases, we derive an asymptotic formula with error term for the above mentioned proportion, which contains an unexpected occurrence of the Gamma-function.We apply these results to estimate the proportion of elements of order 2f in Sn, and of order 3f in An and Sn, where gcd(2, f) = 1, and gcd(3, f) = 1, respectively, and log f is polylogarithmic in n. We also give estimates for the probability that the fth power of such elements is a transposition or a 3-cycle, respectively. An algorithmic application of these results to computing in An or Sn, given as a black-box group with an order oracle, is discussed.
- 1 September 2002
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 11 (5) , 447-464
Permutations with Restricted Cycle Structure and an Algorithmic Application
Let q be an integer with q [ges ] 2. We give a new proof of a result of Erdös and Turán determining the proportion of elements of the finite symmetric group Sn having no cycle of length a multiple of q. We then extend our methods to the more difficult case of obtaining the proportion of such elements in the finite alternating group An. In both cases, we derive an asymptotic formula with error term for the above mentioned proportion, which contains an unexpected occurrence of the Gamma-function.We apply these results to estimate the proportion of elements of order 2f in Sn, and of order 3f in An and Sn, where gcd(2, f) = 1, and gcd(3, f) = 1, respectively, and log f is polylogarithmic in n. We also give estimates for the probability that the fth power of such elements is a transposition or a 3-cycle, respectively. An algorithmic application of these results to computing in An or Sn, given as a black-box group with an order oracle, is discussed.