On the relational complexity of a finite permutation group (Q256538)

The relational complexity \(\rho\) of a permutation group was introduced by the author et al. [J. Comb. Theory, Ser. A 74, No. 2, 249--286 (1996; Zbl 0854.20002)]. The author determines all finite primitive affine permutation groups with relational complexity \(\phi =2\); the proof requires the classification of the finite simple groups. Moreover, he corrects the computation of \(\rho\) for alternating groups acting on \(k\)-sets, correcting a statement in [the author, in: The Gelfand Mathematical Seminars, 1996--1999. Dedicated to the memory of Chih-Han Sah. Boston, MA: Birkhäuser. 15--48 (2000; Zbl 0955.03040)].