Multiplicity-free and self-paired primitive permutation groups (Q1320216)

Let \(G\) be a permutation group acting on the set \(\Omega\) with permutation character \(\chi\). The group \(G\) is said to be multiplicity- free on \(\Omega\) if \((\chi,\varphi) \leq 1\) for all irreducible characters \(\varphi\) of \(G\) and \(G\) is called self-paired if for all \(\alpha,\beta \in \Omega\) there is \(g \in G\) such that \(\alpha^ g = \beta\) and \(\beta^ g = \alpha\). It is known that if \(G\) is a distance-transitive group of automorphisms of a distance-regular graph \(\Gamma\), then the permutation character of \(G\) on vertices of \(\Gamma\) is multiplicity-free. Therefore results on multiplicity-free permutation characters of finite groups are of use in classifying distance-transitive graphs. Since rank-3 primitive permutation groups \(G\) of even order act on two complementary distance- transitive graphs of diameter 2 [\textit{C. Praeger}, \textit{J. Saxl} and \textit{K. Yokoyama}, Proc. Lond. Math. Soc., III. Ser. 55, 1-21 (1987; Zbl 0619.05026)] and the distance-transitivity implies that the group \(G\) is self-paired and that the primitive group \(G\) is multiplicity-free, results on self-paired or multiplicity-free permutation characters are of interest. Multiplicity-free permutation characters of the alternating and symmetric groups have been found by \textit{J. Saxl} [Lond. Math. Soc. Lect. Note Ser. 49, 337-353 (1981; Zbl 0454.20010)]. The corresponding problem has been solved for all the primitive multiplicity-free permutation characters of any group with socle \(PSL_ n(q)\), \(n\geq 8\), [\textit{N. Inglis, M. Liebeck} and \textit{J. Saxl}, Math. Z. 192, 329-337 (1986; Zbl 0578.20006)]. The author of the paper under review obtains reduction theorems for the type of a permutation group having a multiplicity-free or a self-paired primitive permutation character. Because of the O'Nan-Scott-Aschbacher theorem any primitive permutation group is of one of the following types: (i) affine type (ii) almost simple type (iii) diagonal type (iv) blow-up of a primitive permutation group of almost simple or diagonal type (v) twisted wreath type. The reduction theorems in this paper describe the class of primitive permutation groups of types (i), (iii), (iv) and (v) which have a multiplicity-free or self-paired permutation character.