TY - JOUR
T1 - A Reduction Algorithm for Large-Base Primitive Permutation Groups
AU - Law, Maska
AU - Niemeyer, Alice
AU - Praeger, Cheryl
AU - Seress, Akos
PY - 2006
Y1 - 2006
N2 - The authors present a nearly linear-time Las Vegas algorithm that, given a large-base primitive permutation group, constructs its natural imprimitive representation. A large-base primitive permutation group is a subgroup of a wreath product of symmetric groups Sn and Sr in product action on r-tuples of k-element subsets of {1, ..., n}, containing Anr. The algorithm is a randomised speed-up of a deterministic algorithm of Babai, Luks, and Seress.
AB - The authors present a nearly linear-time Las Vegas algorithm that, given a large-base primitive permutation group, constructs its natural imprimitive representation. A large-base primitive permutation group is a subgroup of a wreath product of symmetric groups Sn and Sr in product action on r-tuples of k-element subsets of {1, ..., n}, containing Anr. The algorithm is a randomised speed-up of a deterministic algorithm of Babai, Luks, and Seress.
M3 - Article
VL - 9
SP - 159
EP - 173
JO - LMS Journal of Computation and Mathematics
JF - LMS Journal of Computation and Mathematics
SN - 1461-1570
ER -