Abstract
A permutation representation of a finite group is multiplicity-free if all the irreducible constituents in the permutation character are distinct. There are three main reasons why these representations are interesting: it has been checked that all finite simple groups have such permutation representations, these are often of geometric interest, and the actions on vertices of distance-transitive graphs are multiplicity-free.
In this paper we classify the primitive multiplicity-free representations of the sporadic simple groups and their automorphism groups. We determine all the distance-transitive graphs arising from these representations. Moreover, we obtain intersection matrices for most of these actions, which are of further interest and should be useful in future investigations of the sporadic simple groups.
| Original language | English |
|---|---|
| Pages (from-to) | 3379-3427 |
| Number of pages | 49 |
| Journal | Communications in Algebra |
| Volume | 23 |
| Publication status | Published - 1995 |
Keywords
- MAXIMAL-SUBGROUPS
- LINEAR-GROUPS
- BABY MONSTER
- G LESS
- GRAPHS
- CONSTRUCTION