The character of a permutation representation counts fixed points: . Its self-inner-product counts orbits on ordered pairs, while its inner product with the trivial character counts orbits on the original set.
Subgroups of a finite group are Gassmann equivalent if for every conjugacy class . Equivalently their coset permutation representations have the same character of a representation. They need not be conjugate subgroups. The Sunada theorem turns this equality into equality of Laplacian eigenfunction multiplicities.
For an odd prime , embed the elementary abelian group and the Heisenberg group over a prime field regularly in . Every nonidentity element has order and hence regular permutation cycle type . The two subgroups have equal intersection counts with every symmetric-group conjugacy class, so they are Gassmann equivalent, but they are not isomorphic because one is abelian and the other is not. Using a compact simply connected isometric cover with ambient deck group gives quotients with these nonisomorphic fundamental groups; Sunada theorem makes them isospectral while their topology differs.
For a subgroup , the permutation character of the coset action on is the induced trivial characterand
For a finite -set , the coefficient-sum map is equivariant. Its kernelis the augmentation subrepresentation. If is nonempty, then
For a transitive finite -set with at least two points, the augmentation subrepresentation of a permutation representation is irreducible if and only if the action is two-transitive. Indeed, writing the permutation character as givesThe augmentation subrepresentation is irreducible exactly when this norm is two. By the character norm of a permutation representation, that means that the diagonal and the off-diagonal are the only two orbits on , which is exactly two-transitivity.
If is the character of , then Burnside lemma applied to the diagonal action on givesFor a transitive action , this also equals the number of double cosets in .
Let act on the -element subsets of , with permutation character . If , thenbecause orbits of pairs are classified by intersection size .
For , the equivariant map from -subsets to -subsets that sends each subset to the sum of the -subsets containing it is injective over . Hence is the character of a representation.
The permutation representation of on decomposes asThe first summand is the trivial representation and the second is the -dimensional standard representation.
For the sum-zero standard representation of the symmetric group, the vectors form a Gelfand–Tsetlin basis. The Young–Jucys–Murphy element has eigenvalue for , for , and for . Normalizing by gives an orthonormal basis corresponding to tableaux of shape whose second-row entry is .
The standard representation of the symmetric group restricts irreducibly to . Its character has value at the identity and on each nonidentity element of the normal Klein four-group. Restricted to that subgroup, it is the sum of the three nontrivial linear characters.
Articles by others on the same topic
In the context of group theory, a **permutation representation** is a way of representing a group as a group of permutations. Specifically, if \( G \) is a group, a permutation representation of \( G \) is a homomorphism from \( G \) to the symmetric group \( S_n \), which is the group of all permutations of a set of \( n \) elements.