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 s...
AbstractA complete mapping of a group G is a permutation ϕ:G→G such that g↦gϕ(g) is also a permutati...
AbstractWe analyze the permutation representations of low degree of Held's simple group He. We also ...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
A permutation representation of a finite group is multiplicity-free if all the irreducible constitue...
In this paper we classify all multiplicity-free faithful per- mutation representations of the coveri...
AbstractThis paper is a contribution to the programme to classify finite distance-transitive graphs ...
A transitive permutation representation of a finite group G is said to be multiplicity-free if each ...
Abstract. In this paper we classify all multiplicity-free faithful permutation representations of th...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
AbstractLet Γ be a graph and G ≤ Aut(Γ). The group G is said to act distance-transitively on Γ if, f...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
AbstractWe introduce a database containing the character tables of the endomorphism rings of the mul...
Using the classification of the finite simple groups, we classify all finite generalized polygons ha...
AbstractA complete mapping of a group G is a permutation ϕ:G→G such that g↦gϕ(g) is also a permutati...
AbstractWe analyze the permutation representations of low degree of Held's simple group He. We also ...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...
A permutation representation of a finite group is multiplicity-free if all the irreducible constitue...
In this paper we classify all multiplicity-free faithful per- mutation representations of the coveri...
AbstractThis paper is a contribution to the programme to classify finite distance-transitive graphs ...
A transitive permutation representation of a finite group G is said to be multiplicity-free if each ...
Abstract. In this paper we classify all multiplicity-free faithful permutation representations of th...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
AbstractLet Γ be a graph and G ≤ Aut(Γ). The group G is said to act distance-transitively on Γ if, f...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
AbstractWe introduce a database containing the character tables of the endomorphism rings of the mul...
Using the classification of the finite simple groups, we classify all finite generalized polygons ha...
AbstractA complete mapping of a group G is a permutation ϕ:G→G such that g↦gϕ(g) is also a permutati...
AbstractWe analyze the permutation representations of low degree of Held's simple group He. We also ...
AbstractA distance-transitive antipodal cover of a complete graphKnpossesses an automorphism group t...