Regular Permutation Groups and Cayley Graphs
Cheryl E. Praeger
Fri, Jul 10, 2009
University of New South Wales, Sydney, Australia
1st PRIMA Congress
Regular permutation groups are the `smallest' transitive groups of permutations, and have been studied for more than a century. They occur, in particular, as subgroups of automorphisms of Cayley graphs, and their applications range from obvious graph theoretic ones through to studying word growth in groups and modeling random selection for group computation. Recent work, using the finite simple group classification, has focused on the problem of classifying the finite primitive permutation groups that contain regular permutation groups as subgroups, and classifying various classes of vertex-primitive Cayley graphs. Both old and very recent work on regular permutation groups will be discussed.
You are missing some Flash content that should appear here! Perhaps your browser cannot display it, or maybe it did not initialize correctly.