Representations of Permutation Groups |
Contents
Characters of wreath products | 3 |
An application to representation theory Symme | 62 |
An application to combinatorics The theory | 89 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
a₁ algebraically closed apply basis group beads of colour Bruijn Burnside's lemma character table combinatorics complete system conjugacy classes conjugates corollary corresponding matrix cycle-index decomposition matrix defined denotes dimension double cosets elements enumeration problems enumeration theorem equal evaluate finite group following holds G₁ group G Hence idempotent identity representation implies inertia group irreducible constituents K-representation lemma Littlewood mapping Math matrix representation natural number necklace normal subgroup number of orbits number of types obtain ordinary irreducible representations ordinary representation pairwise inequivalent permutation character permutation group permutation representation Pólya polynomial Proof rational integral representation of G representation theory respect S-functions S₂ S2 Sn selfassociated sentation splitting subgroup of index symmetric groups symmetrized inner products system of pairwise transitive types of graphs underlying vector space V₁ vector space Weyl groups wreath products yields оооо