Choose two positions independently and uniformly from and swap them. This Markov chain on the symmetric group holds with probability and assigns probability to each unordered transposition. Its stationary distribution is uniform, and its ordinary spectral gap is for . The latter follows from the Aldous spectral gap theorem: the single-label continuous-time Markov chain has rate between every pair of positions, whose mean-zero eigenvalues are all .
Rotational symmetry group of a cube Created 2026-10-05 Updated 2026-10-06
The orientation-preserving symmetries of a cube are the signed permutation matrices with determinant one. There are of them. Their group action on the four body diagonals identifies this group with the symmetric group . Indeed choose diagonal directions , whose sum is zero and whose only linear relation has all coefficients equal. A rotation fixing every diagonal sends each direction to itself or its negative; the relation forces all four signs equal. All negative would give , which has determinant , so the kernel of a group homomorphism is trivial. Both groups have order 24, giving the identification. Its face permutations have cycle types , , , and , occurring times respectively.
Schur–Weyl duality 2026-10-07
The commuting actions of the symmetric group and the general linear group on a tensor power are mutual commutants. The displayed sum ranges over partitions with at most rows. The Specht modules and Schur modules are the simple factors for the two actions. In particular a primitive Young symmetrizer selects one copy of the matching Schur module.
Tetrahedral symmetry Created 2026-10-06 Updated 2026-10-07
A regular tetrahedron has a proper rotational symmetry group of order 12, isomorphic to the alternating group acting on its four vertices. Its full spatial symmetry group has order 24 and is isomorphic to the symmetric group ; the additional operations reverse orientation. Three-fold vertex/face-axis rotations and half-turns about opposite-edge midpoints generate the proper group. The distinction matters when a field symmetry uses only proper rotations, but a scalar density also admits reflections.
Associate a transposition to each edge of a finite connected graph. For a simple path , let . Then , using rightmost-first composition. Thus edge transpositions generate every transposition, and hence the full symmetric group.
Variable-permutation action on polynomials Created 2026-10-06 Updated 2026-10-07
The symmetric group acts on multivariate polynomials by replacing each variable by . With , substitution gives . Thus it is a left group action. A polynomial encoding a combinatorial partition has a group orbit encoding all relabelings and a stabiliser subgroup encoding its label symmetries.
Young symmetrizer 2026-10-07
For a Young tableau , let sum its row permutations and be the signed sum of its column permutations in the group algebra of the symmetric group. The product is a Young symmetrizer. The other order is another conventional realization. It satisfies , where is the hook product of a partition, so division by that scalar gives a primitive idempotent in characteristic zero. Acting on a tensor power constructs a Schur module.
The standard-tableau right-ideal decomposition of , tensored over that algebra with , gives this direct sum of general linear group modules. With , the map is an isomorphism. Individual summands generally need not be symmetric group submodules; instead each is a Schur module for the commuting action.