Knowra Cheryl Praeger Cheryl Praeger Cheryl Praeger is an Australian mathematician whose work spans group theory, combinatorics, and permutation groups, especially the structure and classification of finite groups acting on sets.
László Babai : A Hungarian-American mathematician known for work in computational group theory, graph isomorphism, and combinatorics. His work on permutation groups and algorithms overlaps with Praeger's research interests.
Graph automorphism group : The group of all vertex permutations that preserve adjacency in a graph. Praeger's research examines how groups act as symmetries of graphs.
Group action : A rule assigning each group element a structure-preserving transformation of a set, consistently with group multiplication. Permutation groups arise precisely when a group acts on a set.
Australian Academy of Science : Australia's independent academy of leading researchers, established to advance scientific knowledge and advice. Praeger was elected a Fellow, reflecting her standing in Australian science.
Peter Cameron : A British mathematician whose work includes permutation groups, design theory, and finite geometry. Cameron and Praeger have both shaped modern research on permutation groups.
Vertex-transitive graph : A graph whose automorphism group can map any vertex to any other vertex. These graphs provide a central setting for studying permutation groups and symmetry.
Permutation group : A group of bijections from a set to itself, with composition as the operation. This is the algebraic object at the heart of much of Praeger's research.
International Mathematical Union : An international organization that promotes mathematical cooperation and supports the global mathematical community. Praeger served as its vice-president, contributing to international mathematical governance.
Martin Liebeck : A British mathematician known for research on finite groups, representation theory, and permutation groups. His classification results provide tools for questions about finite group actions that also occupy Praeger's work.
Combinatorial design : A collection of finite sets arranged so that specified subsets occur with controlled frequencies. Group actions can reveal and constrain the symmetries of these structures.
Show all 20