Permutation group

Permutation group
Original: Jakob.scholbach Vector: Pbroks13 · CC BY-SA 3.0 · source
Name	Permutation group
Field	Mathematics
Discovered	19th century
Notable	Évariste Galois, Niels Henrik Abel, Camille Jordan, Sophus Lie, Arthur Cayley, Felix Klein, Emil Artin, Richard Dedekind, William Burnside, Otto Hölder

Permutation group.

A permutation group is a mathematical object studied in group theory, consisting of a set of bijections of a given set closed under composition and inverses. It plays a central role in the work of Évariste Galois, Camille Jordan, and Arthur Cayley and connects to problems in number theory, algebraic geometry, combinatorics, and topology. Permutation groups provide concrete models for abstract groups, tie into the classification of finite simple groups, and appear in applications ranging from the Rubik's Cube to symmetry analysis in chemical crystallography and designs in coding theory.

Definition and basic concepts

A permutation group on a set X is a subgroup of the symmetric group Sym(X), the group of all bijections X→X under composition; classical references include work by Arthur Cayley and Camille Jordan. Elements of a permutation group are called permutations and are often written in cycle notation; cycle structure and cycle type are central in the writings of Augustin-Louis Cauchy and Édouard Lucas. Key basic notions include orbit, stabilizer, transitivity, semiregularity, primitivity, and imprimitive block systems, developed in studies by William Burnside and Otto Hölder. The orbit-stabilizer theorem links cardinalities of orbits to subgroup indices, a theme in Felix Klein's symmetry perspectives. A permutation group's degree is the cardinality of X; finite degree cases dominated early group theory literature such as Sophus Lie's and Richard Dedekind's contributions.

Examples and types

Important concrete families include the full symmetric group Sym(n) and the alternating group Alt(n), extensively treated by Évariste Galois and Camille Jordan. Cyclic groups generated by a single n-cycle realize regular permutation groups appearing in Niels Henrik Abel's era. Dihedral groups D_n act on n-gons and connect to Felix Klein's Erlangen program and to patterns studied by William Rowan Hamilton. Wreath products produce imprimitive permutation groups used in permutation group constructions by G. A. Miller and Otto Hölder. Primitive groups appear in the classification efforts culminating in the classification of finite simple groups project involving Daniel Gorenstein, John Conway, and Michael Aschbacher. Sporadic simple groups such as the Monster group, Mathieu group M_24, and Janko groups arise as primitive permutation groups on specific combinatorial structures originally studied by Émile Mathieu and later by Bernd Fischer.

Group actions and permutation representations

Permutation representations interpret abstract groups as groups of permutations via faithful actions; Arthur Cayley's theorem guarantees every finite group embeds in some symmetric group. Actions on coset spaces yield transitive permutation representations central to Évariste Galois's resolvent method and to modern Galois theory as developed further by Emil Artin and Richard Dedekind. Imprimitive and primitive action distinctions are crucial in the work of Camille Jordan and in the O'Nan–Scott theorem developed in the late 20th century by Michael O'Nan and Leonard Scott. Permutation characters and permutation modules connect to representation theory studied by Issai Schur and Richard Brauer and appear in analyses by Bertram Huppert.

Structural properties and classifications

Structure results tie permutation groups to subgroup lattices, Sylow theory, and normal series, themes from William Burnside and Otto Hölder. The study of primitive permutation groups led to the O'Nan–Scott classification, which interacts with the classification of finite simple groups finalized by researchers including Daniel Gorenstein and Robert Griess. Solvable permutation groups and Frobenius groups were characterized by Issai Schur and Bertram Huppert; Frobenius kernels and complementary subgroups feature in investigations by John Thompson and Walter Feit. The minimal degree of a permutation representation and base size research involve contributions from Peter Cameron and Charles Sims. Computational classification and algorithms owe much to Ákos Seress and Markus Conder in the context of permutation group algorithms used in GAP and Magma software projects.

Important subgroups and constructions

Stabilizers, pointwise stabilizers, and setwise stabilizers form fundamental subgroups described by Camille Jordan. Normalizers, centralizers, and core subgroups appear in the structural study found in work by Otto Hölder and William Burnside. Wreath products, direct and wreath product decompositions, and product action constructions are standard tools attributed to G. A. Miller and refined by John Conway. Regular subgroups and sharply k-transitive groups were classified in paths explored by Émile Mathieu and later researchers such as Leonard Scott. The Fitting subgroup, socle, and components play roles in the analysis of permutation group structure within the program led by Daniel Gorenstein and Michael Aschbacher.

Applications and connections to other fields

Permutation groups arise in Galois theory of polynomial equations as symmetry groups of roots, central to Évariste Galois's original insights; they also appear in algebraic number theory studied by Emil Artin. In combinatorics they govern automorphism groups of block designs, graphs, and finite geometries examined by E. T. Parker and R. C. Bose. Coding theory and cryptography exploit permutation group constructions in works by Claude Shannon-era and later cryptographers; chemical crystallography and molecular symmetry utilize permutation actions akin to those cataloged by Linus Pauling. Computational group theory implementations in GAP and Magma enable enumeration and algorithmic analysis, serving research in theoretical computer science and in enumerative problems pursued by Harald Helfgott and Timothy Gowers.

Category:Group theory