Orbit closed permutation groups, relation groups, and simple groups

A permutation group G on a set Ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega $$\end{document} is called orbit closed if every permutation of Ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega $$\end{document} preserving the orbits of G in its action on the power set P(Ω)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P(\Omega )$$\end{document} belongs to G. It is called a relation group if there exists a family R⊆P(Ω)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$R \subseteq P(\Omega )$$\end{document} such that G is the group of all permutations preserving R. We prove that if a finite orbit closed permutation group G is simple, or is a subgroup of a simple group, then it is a relation group. This result justifies our general conjecture that with a few exceptions every finite orbit closed group is a relation group. To obtain the result, we prove that most of the finite simple permutation groups are relation groups. We also obtain a complete description of those finite simple permutation groups that have regular sets, and prove that (with one exception) if a finite simple permutation group G is a relation group, then every subgroup of G is a relation group.


Introduction
Our research is motivated by a problem that arose originally in applications of permutation groups to computer science. In 1991, a problem concerning parallel complexity of languages led Clote and Kranakis [6] to consider the question which permutation groups can be represented as the symmetry groups of boolean functions.  for all x 1 , x 2 , . . . , x n ∈ {0, 1}. Denote by BG R (2) the class of all permutation groups that are the symmetry groups of boolean function. The analogous notation BG R(k) stands for the class of all permutation groups that are the symmetry groups of k-valued boolean function, i.e., those that have the arguments in the set {0, 1}, but take values in the set {0, 1, . . . , k − 1}. Finally, BG R is the union of all BG R(k) for any k ≥ 2.
In [6], as a key result, a theorem was stated that actually BG R = BG R (2), i.e., that every permutation group that can be represented as the symmetry group of a k-valued boolean function can be represented as the symmetry group of an ordinary (2-valued) boolean function. Yet, in [19], this result was shown to be false. A critical gap in the proof was pointed out, and a counterexample was found. It has been observed that the Klein four group K 4 in its natural action belongs to BG R(3), but not to BG R (2).
Considering classes BG R(k), we treat permutation groups up to permutation isomorphism (i.e., up to labeling the points being permuted). Treating n-tuples (x 1 , x 2 , . . . , x n ) ∈ {0, 1} n as the indicator functions of subsets of the set of indices {1, 2, . . . , n}, each boolean function F on n variables may be considered as a function F(x) from the family of the subsets x ⊆ {1, 2, . . . , n} to {0, 1}, and this is the way we use in this paper. This yields the correspondence of the boolean functions with hypergraphs (defined as families of subsets) and shows that the class BG R(2) may be viewed as the class of the automorphism groups of hypergraphs (cf. [25]). A family of subsets may be also treated as an unordered relation, and the symmetry group of the corresponding boolean function as the invariance group of such a relation. That is why the members of BG R (2) are called relation groups in [7]. The classes BG R(k) correspond to the automorphism groups of colored hypergraphs or relational structures. In particular, BG R is exactly the class of permutation groups that are orbit closed.
In [7], Dalla Volta and Siemons proved that a finite primitive permutation group is orbit closed if and only if it is a relation group (and that most of the primitive groups are relation groups). The same they did for many classes of finite imprimitive groups. On the other hand, in [7,Corollary 5.3], they stated that there are infinitely many examples of imprimitive permutation groups that are orbit closed but not a relation group. Unfortunately, as it was noted in [13], the proof of this claim contains an error. Given as an example the group C 3 L and other examples suggested in the proof are indeed not relation groups, but they are not orbit closed either.
So, the intriguing problem of whether there are only a few exceptions to the general equality that BG R = BG R (2) or whether the classes BG R(k) contain many unknown permutation groups (and hence types of boolean functions), remains open. With the current state of knowledge, our guess is the following.
Conjecture. Every finite orbit closed permutation group, but a few exceptions, is a relation group.
So far, the only known exception is K 4 . In [12], we have confirmed this conjecture for abelian permutation groups. In fact, our result includes a larger class of permutation groups, namely all subgroups of direct sums of regular permutation groups. It was proved, in particular, that each member of this class, but listed exceptions, is a relation group.
In this paper, we consider the problem for the other extreme: the class of those permutation groups that are simple as abstract groups. The fact that these groups have no nontrivial normal subgroups, on the one hand, and the classification of finite simple groups, on the other hand, make it feasible to verify the conjecture for this class. In particular, looking for other possible exceptions to the general claim, it is natural to inspect this very class.
It follows from the results of [7] that the only primitive simple groups, other than A n , that are not the relation groups are P SL (2,8) and C 5 in their natural actions. Yet, simple groups also have various imprimitive and intransitive actions, and we wish to establish which of the corresponding imprimitive and intransitive permutation groups are relation groups, and which are not.
At this point, the reader should note that the whole problem is focused, in fact, on the intransitive actions of groups. The main difficulty lies in the intransitive case. Both [12] and the present paper illustrate this.
Note that, in most applications, intransitive actions are often more natural than transitive ones. For instance, most graphs are not vertex transitive and the action of the automorphism group on different orbits may be very different and essential with regard to various graph properties. The same is true about groups of automorphisms of any kind of incidence structure. Now, while there are properties of intransitive permutation groups that can be inferred directly from the properties of their transitive constituents, there are combinatorial properties of intransitive permutation groups that depend also on how the actions on different orbits are related to each other. Orbit closeness and being a relation group are such properties. For example, some permutation groups isomorphic abstractly to the alternating group A n are orbit closed, while some of them are not (see Theorem 6.1).
The paper is organized as follows. We start with recalling the basic notions in Section 2. In the next section, we deal with transitive imprimitive simple permutation groups. We show that all such groups are relation groups. Intransitive actions of simple groups are described in Proposition 5.1. This is relatively easy to do using the description of the general construction of intransitive permutation groups contained in [19]. This construction and some basic results are recalled for the reader convenience in Section 4. Next, using the classification of the simple groups and results from [2,7,19,21], we prove a number of lemmas on intransitive simple groups, leading to our main result, which is given in Theorem 6.1. It provides a complete description of all simple relation groups. All the remaining simple permutation groups, which includes many intransitive groups abstractly isomorphic to alternating groups, are proved not to be orbit closed. Our research yields also additional results characterizing simple permutation groups that have a regular set (Theorem 6.2), and showing that (with one exception) the property that a simple permutation groups is a relation group is inherited by subgroups (Theorem 6.3).
Throughout, many particular cases arise that require some computer calculations. We have used system GAP 4.10.1. In cases of applying GAP, we try to give only those computational details that seem sufficient for the reader to verify our results, using any computational system for permutation groups.

Prerequisites
A permutation group G is a subgroup of the symmetric group Sym( ) on a set . In this paper, all permutation groups are finite and considered up to permutation isomorphism [9, p. 17] (i.e., two groups that differ only in labeling of points are treated as the same). A permutation group G is called trivial, if the only permutation in G is the identity. The symmetric group on n elements is denoted by S n = Sym({1, 2, . . . , }), and the alternating group on n elements is denoted by A n . The cyclic group generated by the permutation (1, 2, . . . , n) is denoted by C n . We use standard notation for abstract groups (used in [9]) as the notation for permutation groups in their natural actions. The projective special linear groups are denoted by P SL (d, q) or L d (q) (depending on the source we refer to). We recall that in their natural actions they are permutation groups on n = (q d − 1)/(q − 1) elements.
Following [3], we write permutations on the right, and compose from left to right (as in the notation α(gh) = (αg)h). The same notation is applied to the action of permutations on subsets or pairs of elements of the underlying set . Yet, the orbit of a set x ⊆ in the action of G ≤ Sym( ) on the subsets of is denoted by x G .
We view boolean functions F(x) as the functions from the set P( ) of the subsets of a set to the set {0, 1}. The family of sets x with F(x) = 1 is considered as an unordered relation R on , and the symmetry group of F is the set of permutations of preserving R (cf. [7]). We will use the notation G = G(R) for this group, and refer to R as a defining relation for G. More generally, for a k-valued boolean function F, the family R = (R 0 , . . . , R k−1 ) of relations R i defined by F(x) = i may be considered as a relational structure P( , R) (of unordered relations), and the symmetry group of F is the set of permutations of preserving all the relations in R.
The action of a group G ≤ Sym( ) on the power set P( ) preserves the cardinalities of the subsets, so it has at least | | + 1 orbits. If G = G(R), then obviously R must be a union of some orbits of G in its action on P( ), and this observation is used in looking for defining relations for a permutation group. Some further observations will also be useful in this regard. Note that it does not matter for the definition whether ∈ R or not. Next, if G is transitive, then either all singletons belong to R or no singleton belongs to R. The same concerns the complements of singletons in , because the action of G on a set x and \ x is essentially the same. Note also that a permutation u on preserves R if and only if it preserves the sets of cardinality k in R, for each 1 ≤ k < . The arity of the defining relation R is the set of cardinalities ar(R) = {|x| : x ∈ R}. In this connection, recall that a permutation group G ≤ Sym( ) is k-homogeneous if its action on k-element subsets of is transitive. It is called set-transitive if it is k-homogeneous for every k ≤ | |. In this paper, we will make use of the description of the set-transitive permutation groups provided in [2].
Given a permutation group G ≤ Sym( ), a subset x ⊆ is called regular, if the (setwise) stabilizer of the set x in G is trivial. In such a case G acts regularly on the orbit x G in the power set P( ). An existence of a regular set for G is equivalent with having a regular orbit in P( ), that is, an orbit of length |G| ( [5,21]).
The notions of regular set and regular orbit in the set of subsets are closely connected with that of distinguishing number for groups (see [26]). Recall, that the distinguishing number of a permutation group G ≤ Sym( ), denoted by D(G), is the least positive integer k such that there exists a partition of into k parts with the property that only the identity of G stabilizes each part. In particular, D(G) = 2 if and only if G has a regular set [8].

Imprimitive simple groups
Let G be a permutation group that is simple as an abstract group. As we have mentioned in the introduction, if G is in addition primitive, then by [7,Theorem 4.2], except for alternating groups A n , and two additional groups, C 5 and P SL (2,8), each simple primitive group is a relation group. Thus, in this section, as the first step, we focus on transitive simple groups that are imprimitive.

Proposition 3.1 Each simple imprimitive permutation group G has a regular set, and all subgroups of G are relation groups.
As it is well known, for transitive permutation groups G (considered up to permutation isomorphism), it is enough to study faithful actions of G on its cosets. In this paper, by a coset we always mean a right coset. By G/H we denote the set of all (right) cosets of a subgroup H in G. The permutation group given by such an action is denoted by (G, G/H ). Note that, if G is simple and H is proper, then each action of G on G/H is faithful and gives rise to a transitive permutation group. It is primitive if and only if H is maximal. Now, given an abstract simple group G, let N < G. Suppose that (G, G/N ) is not primitive. Then, there exists a maximal subgroup H of G with N < H < G. Thus, the group (G, G/H ) is primitive. Elements g ∈ G act faithfully both on G/N and G/H , and the first action respects H -cosets and determines the second action. We will say that a subset x ∈ P(G/N ) is compatible with the cosets of H , or H -compatible, if, for any g ∈ G, the condition x ∩ Hg = ∅ implies x ⊇ Hg. For such an x, byx we denote the corresponding set of cosets of H .
We start from a technical lemma, which allows us to transfer our results into subgroups of a given group. It is a strengthening of [7, Lemma 3.1].

Lemma 3.2 Let H ≤ S n be a permutation group and y a regular set in H .
Suppose that H = G(R) and let R be the relation obtained from R by deleting the sets of cardinality |y|. Let G = G(R ). If y G ∩ R = ∅, then every subgroup of H is a relation group. In particular, this is so, if |y| / ∈ ar(R).
Proof Let K ≤ H , and let Q = y K . We show that K = G(R ∪ Q). Obviously K preserves Q, and as a subgroup of H , it preserves R. Consequently, K ⊆ G(R ∪ Q).
Conversely, let g ∈ G(R ∪ Q). We show that g ∈ K . Let R be the family of sets in R of cardinality |y|. Then, R ∪ Q = R ∪ R ∪ Q. The cardinalities of sets in R are different than |y|, so g preserves R . It follows that g ∈ G. Hence, g preserves y G , and since y G ∩ R = ∅, it preserves Q ⊆ y G . It follows that g preserves R , and therefore, g preserves R = R ∪ R . This implies that g ∈ H . And finally, since y is regular in H , and g preserves Q = y K , it follows that g ∈ K , as required.
Using the above lemma, we are going to prove that most of simple permutation groups G have the following two properties: (a) G has a regular set, (b) each subgroup of G is a relation group. Such groups could be referred to as hereditarily relation groups with a regular set. In order to shorten repetitive wording, we use the symbol R * for the class of permutation groups G satisfying (a) and (b). Note that if x is a regular set for G, then it is regular for each subgroup of G. So, if G ∈ R * , then each subgroup of G belongs to R * , as well.
We prove three reduction lemmas. Proof Let R be a relation on G/H such that G(R ) = (G, G/H ). Since (G, G/H ) is transitive, we may assume without loss of generality that Hg ∈ R for any g ∈ G.
Let R 0 be the corresponding relation on G/N , that is, consisting of all sets x ⊆ G/N such that there exists a set x ∈ R and x = {Ng : g ∈ G andHg ∈ x }. We use it to form a relation R on G/N defining (G, G/N ). To this end, let y be an H -compatible subset of G/N such thatȳ is a regular set of (G, G/H ) and H / ∈ȳ. (Such a set exists, since by assumption, (G, G/H ) has a regular set, and the complement of a regular set is regular). We define R 1 to consist of all sets of the form (y ∪ {N })h for h ∈ G. Now, we define R = R 0 ∪ R 1 . Since each set in R 1 has cardinality not divisible by [H : N ], it follows that ar(R 0 ) ∩ ar(R 1 ) = ∅. This means that a permutation u preserves R if and only if u preserves each of R 0 and R 1 .
We show first that G(R) ⊇ (G, G/N ). We need to show that if x ∈ R, then xg ∈ R for any g ∈ G. Indeed, if x ∈ R 0 , then this is so, because g preserves R ; if x = (y ∪ {N })h ∈ R 1 for some h ∈ G, then xg = (y ∪ {N })(hg) ∈ R 1 , as well.
We prove the opposite inclusion . Let u ∈ G(R). By definition of R, u is a permutation of G/N preserving the cosets of H , so we may consider its action on the set G/H . In this action, u preserves R (since in its action on G/N it preserves R 0 ), which means that there exists g ∈ (G, G/H ) = G(R ) whose action on G/H is the same as the action of u on G/H . It is enough to show that the action of u on G/N is the same the action of g on G/N . Note that w = ug −1 acts as the identity on G/H and it preserves the relation R (by the previous inclusion). Let N h be an arbitrary coset of N with h ∈ G. As (y ∪{N })h ∈ R, it follows that (y ∪ {N })hw ∈ R. Consequently, (y ∪ {N })hw = (y ∪ {N })h for some h ∈ G. Thus, yhw ∪ {N }hw = yh ∪ {N }h . Since y is regular in (G, G/H ), and w acts as the identity on H -cosets, h = h , and consequently, N hw = N h. Thus, w fixes N h for any h ∈ G, which means that it acts as the identity on G/N , proving that G is a relation group.
From what we have established it follows also that y ∪ {N } is a regular set in (G, G/N ). Now, the complement of y ∪ {N } is also regular, and its cardinality is not in ar(R), unless [H : N ] = 2, and |y ∪ {N }| = [G : N ]/2. In the latter case y ∪ {N , Ng }, where Ng / ∈ y and g / ∈ N , is also regular and satisfies the assumptions of Lemma 3.2. Thus, G ∈ R * , as required.
In the next lemma, we use the idea of coloring blocks of a partition that appears in the proof of [10, Lemma 2.7]. Let y be a subset of G/N such that for all i, j ≤ n, if i = j then the cardinality |y ∩ s i | = |y ∩ s j |. Such a set y exists, since |s i | = [H : N ] ≥ n − 1 for all i. We may assume that 1 and [H : N ] are among the cardinalities |y ∩ s i |, which guarantees that |y| > |s i |. To fix the notation, we assume that it is s 1 with |y ∩ s 1 | = 1.
We define a relation R as one consisting of all sets s i and all sets x = yh for any h ∈ G. Note that, since |y| = |s i |, the arity ar(R) = {|s i |, |y|}.
The most important property of y is that as |y ∩ s i | gives an injective labeling of H -cosets, y may be used to decode the permutations of H -cosets. More precisely, the mapping φ : G/H → {0, 1, . . . , n} which assigns the value |y ∩ s i | to the H -coset corresponding to the set s i , is injective. Hence, the following holds: ( * ) if u and w are arbitrary permutations of G/N that preserve the partition into sets s i , then the condition yu = yw implies that u and w have the same induced action on the sets s i (H -cosets). Now, similarly as in the previous proof, it is easy to see that G(R) ⊇ (G, G/N ). For the opposite inclusion, assume that u ∈ G(R). Then, since |y| = |s i |, yu = yh for some h ∈ G. By ( * ), u acts on H -cosets as h. Hence, w = uh −1 acts on G/H as the identity and preserves R. Again, all we need to show is that w acts as the identity on G/N .
Suppose to the contrary that there exists a coset β ∈ G/N such that βw = β. Let α denote the unique N -coset in y ∩ s 1 , and let g ∈ G be such that αg = β. Then, for v = gwg −1 we have: (i) αv = α, (ii) v acts as the identity on H -cosets, and (iii) v preserves R. By (iii), yv = yh for some h ∈ G. By (ii) and the definition of y, yv = y. Consequently, v fixes y ∩ s 1 = {α}, which is a contradiction with (i). This proves that (G, G/N ) is a relation group.
From the proof, it follows that y is a regular set in (G, G/N ). We show that there exists a point α = Ng such that y = y ∪{α} is regular, as well. Indeed, if it is possible to add a point to y with keeping the property ( * ), then we are done. Otherwise, if adding a point always causes that two sets y ∩ s i and y ∩ s j , for i = j, become equinumerous in y (which happens when [H : N ] = [G : H ] − 1), then we can choose an arbitrary pair i, j and add a point in such a way that |y ∩ s i | = |y ∩ s j | = 1, and otherwise, the cardinalities |y ∩ s i | are pairwise different. Such a set y is regular in (G, G/N ), by the same argument as that applied to y, unless the transposition (i, j) ∈ (G, G/N ). Since the pair i, j can be chosen arbitrarily, (G, G/N ) has a regular set of cardinality |y| + 1 / ∈ R (unless (G, G/N ) = S n , which is not the case). Applying Lemma 3.2 completes the proof.
Combining the approaches of the two above lemmas, we may get still something more.

Lemma 3.5 Let G be a simple group with subgroups N and H such that N < H < G. If (G, G/H ) is a relation group and
As in the proof of Lemma 3.3, let R 0 be a relation on G/N corresponding to a relation R on G/H such that (G, G/H ) = G(R ). Again, we assume that Hg ∈ R for all g ∈ G.
We define R = R 0 ∪ R 1 , where R 1 consists of all sets x = yh for any h ∈ G. We have ar(R) = ar(R 0 )∪ar(R 1 ). A problem, comparing with the previous proof, is that this union may not be disjoint. However, all we need is the fact that each permutation v preserving R preserves R 1 . Indeed, since all s i ∈ R and |y| > |s i |, v preserves H -cosets, and since yh are the only sets in R that are not the unions of H -cosets, v preserves R 1 .
Further, since G acts faithfully on G/H , and d = D(G, G/H ) is the distinguishing number for (G, G/H ), we have the following property of y (which is enough for our purposes in this case): Again, it is easy to see that G(R) ⊇ (G, G/N ). For the opposite inclusion, assume that u ∈ G(R). Then, since u preserves R 1 , it acts on H -cosets as some h ∈ G. Hence, w = uh −1 acts on G/H as the identity and preserves R. All we need to show is that w acts as the identity on G/N . This part is the same as in the previous proof.
Again, from the proof it follows that y is a regular set in (G, G/N ). We wish to modify it so it is still regular, but also satisfies the assumptions of Lemma 3.2. If Remark We do not need it in this paper, but it is worth noting that the three lemmas above hold for arbitrary groups G > H > N , as long as both actions on G/H and G/N are faithful, and G is different from S n .
We will combine the above lemmas with what is known on primitive groups. In [21], Seress lists all primitive groups that have no regular set (cf. [7, Theorem 2.2]). Using this list one can distinguish all simple groups in primitive action that have no regular set. In the list below the first entry denotes the degree of the action, and the secondthe group itself. If the group is abstractly isomorphic to one of A n or another group in the list with a different name, then this is indicated. There are no other isomorphisms between the groups in the list except those indicated. (This may be inferred from the classification of the finite simple groups, using, e.g., [9, Appendix A].) (11, L 2 (11)), (11, M 11 ), (12, M 11 ), (12, M 12 ), Combining this with [7, Theorem 4.2], we obtain the following: Lemma 3.6 Let G be a simple primitive permutation group of degree n ≥ 2 different from A n . Then, the following hold: Now we prove the main result of this section. We use the notation G + for the permutation group obtained from G by adding an extra fix point. These blocks and the orbits of some sets in T are used to define T by a relation. Let

Proof of Proposition 3.1 Let G be a simple permutation group that is transitive but not primitive. Then, it is permutation isomorphic to
which is isomorphic to S 3 S 5 , and to verify computationally that the cardinality of the stabilizer of R 1 ∪ R 2 in G(B) is exactly |A 5 |. In addition, one can easily check that T has regular sets of sizes from 3 to 12. By Lemma 3.2, T ∈ R * , as required.
(To find regular sets, we have simply asked GAP about the cardinality of the orbits in the action of G on k-element subsets, for each k. If this cardinality is equal to the order of G, it means that each set in the orbit is regular. In other places of this paper, we have used this approach, we just give information about cardinalities of regular sets.) Now, consider the cases when (G, G/H ) is one of the fifteen groups listed in Lemma 3.6. First we assume that (G, G/H ) is a relation group, i.e., is different from P SL (2,8) or C 5 . We intend to combine Lemma 3.5 with [8, Theorem 1] and Table 2 in  (3,2). Then, as H we may take any subgroup of index 7 (since we know that P SL (3,2) has only one primitive action on 7 elements). Now, for any subgroup N of H of index [H : N ] > 2, by Lemma 3.5, (G, G/N ) ∈ R * , as required. Up to conjugation, there is only one subgroup N of H of index 2. Then, (G, G/N ) is a transitive permutation group of degree 14 abstractly isomorphic to P SL (3,2). This is T = 14T10 imprimitive group generated by permutations g = (1, 5, 9, 13, 3, 7, 11)(2, 6, 10, 14,4,8,12), and h = (1, 10,6,14,11,9,12) (2,5,8,3,13,7,4), . Also, it has regular sets of all sizes from 3 to 11, which means that T ∈ R * , as well. We describe how to obtain a relation defining T . First, we take the two-element blocks of imprimitivity and consider the action of M 11 on these blocks. Now, M 11 = G(R) for some relation R (pointed out in [7]). We take the induced relation R on the two-element blocks of T (obtained by replacing each point in R by two points of the corresponding block). Then, all the sets in R are of an even cardinality. It remains to check that there exists a 3-element set whose T -orbit together with R yields a relation generating T (since almost all 3-element sets have this property, we omit the details). In addition, one easily checks that T has regular sets of all sizes from 6 to 18. Since, for example, 7 / ∈ ar(R), by Lemma 3.2, T ∈ R * , as required.
Since there is only one action of M 12 on 12 elements, one may take as H any of the two subgroups of index 12. As before, by Lemma 3.5, Since there is no subgroup N of H of index less than 12, the case is completed.
To complete the proof, it remains to consider two groups that are not relation groups. For C 5 we have nothing to prove, since it has no nontrivial subgroups. For We describe how one can modify the proof of Lemma 3.5 to handle this special case. The only assumption that fails to hold is that (G, G/H ) is a relation group. So, rather than the group (G, G/H ) itself we consider a construction using two-point stabilizer of (G, G/H ), which is in this case G α,β = C ++ 7 (the cyclic group on 7 elements with two extra fix points).
So, let s 1 , . . . , s n , as before, be a partition of G/N into the sets corresponding to Hcosets of G, and let s 1 and s 2 correspond to the H -cosets α and β. Let R be a relation on G/H \ (α ∪ β) such that C 7 = G(R ) and corresponding to the stabilizer G α,β (see, e.g., [19, p. 385] for such a relation). We construct the corresponding relation on G/N : for each x ∈ R by x we denote the subset of G/N consisting of all cosets Ng such that Hg ∈ x. In addition, we choose three points: a ∈ s 1 and b, c ∈ s 2 , and we put x = x ∪ {a, b, c}. By R we denote the family of all sets (x )g for all x ∈ R and g ∈ G. We put R 0 = R ∪ {s 1 , . . . , s n }. The rest of the proof is the same as that of Lemma 3.5. Checking that this construction works is left to the reader.

Subdirect sum of permutation groups
In the next section, we consider intransitive permutation groups that are simple. Here, the main tool is a result describing the construction of intransitive permutation groups in terms of the subdirect sum of permutation groups [19]. In order to make this paper self-contained, we recall here the notion of the subdirect sum and the basic result on it.
Given two permutation groups G ≤ Sym( ) and H ≤ Sym( ), the direct sum G ⊕ H is the permutation group on the disjoint union ∪ defined as the set of all permutations (g, h), g ∈ G, h ∈ H such that Thus, in G ⊕ H , permutations of G and H act independently in a natural way on the disjoint union of the underlying sets. (Abstractly this is a direct product of groups G 1 and G 2 ; we call it a sum to distinguish it from another construction of the direct product of permutation groups acting naturally on × .) Now we define the notion of the subdirect sum following [12] (and the notion of intransitive product in [19]). Let H 1 G 1 ≤ S n and H 2 G 2 ≤ S m be permutation groups such that H 1 and H 2 are normal subgroups of G 1 and G 2 , respectively. Suppose, in addition, that factor groups G 1 /H 1 and G 2 /H 2 are (abstractly) isomorphic and φ : G 1 /H 1 → G 2 /H 2 is the corresponding isomorphism. Then, by we denote the subgroup of G 1 ⊕ G 2 consisting of all permutations (g, h), g ∈ G 1 , h ∈ G 2 , such that φ(H 1 g) = H 2 h. Each such group will be called a subdirect sum of G 1 and G 2 . (Abstractly, this is a subdirect product of the groups G 1 and G 2 .) If H 1 = G 1 and H 2 = G 2 , then G = G 1 ⊕ G 2 is the usual direct sum of G 1 and G 2 . If H 1 and H 2 are trivial one-element subgroups, φ is the isomorphism of G 1 onto G 2 , and the sum is called, in such a case, the parallel sum of G 1 and G 2 . Then, the elements of G are of the form (g, φ(g)), g ∈ G 1 , and both the groups act in a parallel manner on their sets via isomorphism φ. In this case, we use the notation G = G 1 || φ G 2 , where φ is an (abstract) isomorphism between G 1 and G 2 , or simply G = G 1 ||G 2 if there is no need to refer to φ. Note that G 1 and G 2 need to be abstractly isomorphic, but not necessarily permutation isomorphic, and they may act on sets of different cardinalities.
In the special case when, in addition, G 1 = G 2 = G and φ is the identity, we write G (2) for G|| φ G. More generally, for r ≥ 2, by G (r ) we denote the permutation group in which the group G acts in the parallel way (via the identity isomorphisms) on r disjoint copies of a set . This group is called the parallel multiple of G, and its elements are denoted by g (r ) with g ∈ G. In particular, we admit r = 1 and put G (1) = G. For example, the cyclic group generated by the permutation g = (1, 2, 3)(4, 5, 6) (7,8,9) is permutation isomorphic to the parallel multiple C

.
The main fact established in [19] is that every intransitive group has the form of a subdirect sum, and its components can be easily described.
where φ is an isomorphism of the factor groups.
In this paper, we also apply other results established in [19], and the reader is referred there in case of any doubts. In particular, recall that alternating groups A n , for n ≥ 3, are not the symmetry groups of any k-valued boolean function, i.e., they are no orbit closed. Also, the cyclic groups C 3 = A 3 , C 4 and C 5 are not orbit closed.
In turn, S n ∈ BG R(2) for any n > 1. Also, for any k > 1, if groups G, H ∈ BG R(k), then G ⊕ H ∈ BG R(k), and for any r ≥ 2, if H ∈ BG R(k), then H (r ) ∈ BG R(k) [ H and H (r ) . These results will be treated in our proofs as known, without further comments.
There is some subtlety regarding the parallel powers we have to be aware of. A well-known fact is that the automorphism group Aut(G) of a group G may have outer automorphisms that are not given by the conjugation action of an element of G. In the case of permutation groups G ≤ Sym( ), some outer automorphism may still be given by the conjugation action of an element in Sym( ). This corresponds generally to permuting elements of , and such automorphisms are called permutation automorphisms. They form a subgroup of Aut(G), which we denote by P Aut(G). Often P Aut(G) = Aut(G), but some permutation groups also have other automorphisms, which we will call nonpermutation automorphisms. Now, if G = H ⊕ ψ H , for some permutation group H , where ψ ∈ P Aut(G), then G is permutation isomorphic to H (2) (i.e., G = H (2) , according to our convention). If ψ is a nonpermutation automorphism, then G = H (2) . (More precisely, we should speak here about isomorphisms induced by automorphisms and make distinction between base sets of components, but we assume that this is contained in the notion of the disjoint union, and we will make it explicit only when the need arises.) An example is the alternating group A 6 that has a nonpermutation automorphism ψ (cf. [4]). Then, A (2) 6 and A 6 || ψ A 6 are not permutation isomorphic.

Intransitive simple groups
Without loss of generality we may assume that permutation groups G we consider have no fixed points. Indeed, if G has fixed points, then G = G ⊕ I m , where I m is the trivial group on a m-element set and G has no fixed points. All subgroups H ≤ G are of the form H ⊕ I m , where H ≤ G . Hence, it is easy to see that G is simple if and only if G is simple. Moreover, by the results in [19] we know that I m ∈ BG R (2) for all m ≥ 1, and G ∈ BG R(k) whenever G ∈ BG R(k). On the other hand, if G / ∈ BG R, then G / ∈ BG R. So if we prove the dichotomy that either G ∈ BG R(2) or G / ∈ BG R, that is, either G is a relation group or G is not orbit closed, the results extend immediately on G with fixed points. Thus, in the rest of the paper, it is assumed tacitly that permutation groups in question have no fixed points.
Our first result describes the structure of simple permutation groups.

Proposition 5.1 Let G = H [H ] ⊕ φ K [K ] be an intransitive permutation group which has no nontrivial normal subgroups. Then, the groups H and K are simple and isomorphic as abstract groups, and the groups H and K are trivial. In particular, G is the parallel sum
Proof First note that the group H ⊕ I m is a normal subgroup of G (since H H ). As, by our general assumption, K is nontrivial, we infer that H is trivial. Similarly, we observe that K is trivial. It follows that φ is an isomorphism between H and K , and G is isomorphic to both H and K . Therefore, H and K are simple.
The proposition above means that intransitive simple permutation groups with nontrivial orbits always have the form of parallel sums. Some remarks are needed to make a proper use of this result.
Note that (using the inverse isomorphism φ −1 ) we see easily that G 1 || φ G 2 and G 2 || φ −1 G 1 are permutation isomorphic, and since we treat permutation isomorphic groups as identical, the operation of the parallel sum may be considered to be commutative. Further, decomposing each summand step by step we can get a decomposition into transitive components. In particular, in G = (G 1 || φ G 2 )|| ψ G 3 all the involved groups must be abstractly isomorphic, and G is permutation isomorphic with where isomorphisms φ and ψ are suitably determined by φ and ψ. Thus, we may also consider this operation to be associative (up to permutation isomorphism).
So, generally, a simple intransitive permutation group is a parallel sum of two or more transitive components that are all abstractly isomorphic, and the action on the union of orbits is given by a system of suitable isomorphisms between components. (Note that, in general, pointing out a simple abstract group and the cardinalities of the orbits is not enough to determine uniquely, up to permutation isomorphism, the corresponding permutation group. This is so, because some simple groups have nonequivalent actions on a set of a given cardinality For example, projective symplectic group P Sp(4, 3) has two nonequivalent actions on the set of cardinality n = 40.) The following lemma gives some sufficient conditions for a parallel sum to be a relation group.
Now, we put R = R 0 ∪ R 1 ∪ R 2 . We show that G = G(R). First, it is easy to see that each relation R 0 , R 1 , R 2 is preserved by permutations in G, and therefore, G ⊆ G(R). We prove the opposite inclusion.
Note that sets in R 0 are contained in , while each set in R 1 or R 2 has a nonempty intersection with . Further, each set in R 1 contains , which is not the case for any set in R 2 . It follows that the relations R 0 , R 1 , R 2 are mutually disjoint. Moreover, since the sets in R 1 have all cardinality | | + | | − 1, larger than the sets in R 0 and R 2 , it follows that any permutation g preserving R, preserves R 1 itself. Since the elements of R 1 are the complements of one-element subsets of , this means that each g ∈ G(R) preserves the partition into and . In particular, each such permutation may be presented as g = hk with h and k acting on the sets and , respectively.
If so, g preserves also R 0 and R 1 , individually. In particular, the action of G(R) on is contained in the action of H , i.e., h ∈ H . This proves that G(R) ⊆ H ⊕ K , for some K ≤ Sym( ). In order to use Theorem 4.1, we need to show that the pointwise stabilizers of and in G(R) are both trivial.
For the first, suppose that g = hk ∈ G(R) fixes each point of . This means that h is the identity, h = 1. Thus, for each i < m, we have that (y ∪ i )g = y ∪ i k. This must belong to R 2 (since R 2 is preserved by g), which means that y ∪ i k = (y ∪ i )g i , for some g i ∈ G. The only g i ∈ G fixing y is g = 1. Therefore, i k = i for all i < m, which means that k = 1, as required.
Suppose, in turn, that g = hk ∈ G(R) fixes each point κ i ∈ . Then, for each i < m, (y ∪ i )g = yh ∪ i , and since R 2 is preserved by g, yh Since g i ∈ G = H || φ K , k i is uniquely determined by h i , and since y is regular in H , g i = h, for each i < m, and k i = k does not depend on i. Therefore, for each i < m, i = i k for some k ∈ K . In view of the definition of i , this implies that k = k i = 1. Consequently (since g i ∈ H || φ K ), h i = h = 1, as required. By Theorem 4.1, G(R) = H || ψ K for some K ≤ Sym( ) and some isomorphism ψ between H and K .
As we have proved that G ⊆ G(R), we have H || φ K ⊆ H || ψ K , which in view of the finiteness of the groups involved (and the fact that ψ and φ are bijections) implies K = K , proving that G is a relation group.
It remains to prove that G has a suitable regular set, in order to apply Lemma 3.2. First, observe that, since y is regular in H , the complement \ y is also regular in H . It follows that we may assume that |y| = | | − 1, taking the complement of y in , if necessary. In turn, since y is regular in H , the set y ∪ is regular in G = H || φ K . Now, the relation R obtained from R by deleting the sets of cardinality |y| + | |, contains R 1 , and therefore G = G(R ) preserves the partition into and . It follows that the orbit (y ∪ ) G is disjoint with R. Applying Lemma 3.2 completes the proof.
Below we consider the parallel multiple A (r ) n of the alternating group A n . As we will see, it is a relation group if and only if r is sufficiently large with regard to n.

Lemma 5.3 For every n ≥ 3 and r ≥ 1, the parallel multiple A (r )
n is a relation group if and only if 2 r ≥ n. Moreover, if 2 r ≥ n, then A (r ) n ∈ R * ; otherwise, A (r ) n is not orbit closed.
Proof For r = 1 the claim is that A n is not orbit closed, which is the case. So we assume that r ≥ 2. First we consider the parallel multiple of S n and construct a relation Q such that S (r ) n = G(Q). (By [19], we know that S (r ) n is a relation group for any r ≥ 2, but we need an explicit construction of the set Q to use in the further part of the proof.) The group S (r ) n acts on a set U consisting of r disjoint copies of = {1, 2, . . . , n}, and for this proof, we may assume U = {(i, j) : 1 ≤ i ≤ r , 1 ≤ j ≤ n}, meaning that, for a fixed i, the elements (i, j) form the i-th copy of . We define a relation Q ⊆ P(U ) such that S (r ) n = G(Q). We put The first set of the union above contains single elements of the first copy of , while the second set contains suitable unordered pairs. This guarantees that every permutation in G(Q) is of the form g (r ) . Indeed, we need to show that for any i, j and any h ∈ G(Q), the image (i, j)h = (i, jg) for some permutation g of that does not depend on i. Looking for the part containing singletons of Q we infer that (1, j) = (1, jg) To prove the "if part" of the theorem, assume that 2 r ≥ n. We define a regular set y in S (r ) n such that y / ∈ ar(Q), and apply Lemma 3.2. To this end, let j(i) denote the i-th bit (from the right) in the binary notation of the number j. Then, we put (i, j) ∈ y if and only if j(i) = 1. Thus, the sequences (1, j), (2, j), . . . , (r , j) are binary representations of different integers provided 2 r ≥ n.
To see that y is regular, note that applying any permutation h ∈ S (r ) n to y corresponds to changing positions of the integers (1, j), (2, j), . . . , (r , j), in the parallel way for all j. Therefore, all the images yh are different.
Since ar(Q) = {1, 2} we see that |y| / ∈ ar(Q), provided |y| > 2. If this is not the case, we replace y by its complement in U , which is also a regular set, and satisfies the required condition on the cardinality. Thus, by Lemma 3.2, we infer that every subgroup of S (r ) n belongs to R * , as required. For the "only if" part we show that if 2 r < n, then A (r ) n is not orbit closed. To this end, it is enough to show that a permutation g (r ) ∈ S (r ) n with g ∈ S n \ A n preserves the orbits of A (r ) n in P(U ). Let y be any of these orbits. We show that yg (r ) = y. As before, consider the sequence (1, j), (2, j), . . . , (r , j) as one determining the binary notation of an r -bit number m = m j according to the condition: m(i) = 1 if and only if (i, j) ∈ y. Then, since 2 r < n, there are two positions s, t < n such that m s = m t , which means that the corresponding sequences for j = s, t are identical. Consequently, there exists a transposition u ∈ S n such that for w = u (r ) we have ywg (r ) = yg (r ) . Now, wg ∈ A (r ) n , which means that ywg (r ) = y, as required.
In general, if G is a parallel sum of permutation isomorphic components, it needs not to be a parallel multiple. This is so, since permutation groups may have nonpermutation automorphisms. For alternating groups, we have an interesting exception.

Lemma 5.4 Suppose that G is the parallel sum of components permutation isomorphic to a fixed alternating group A n , and G = A (r )
n for any r ≥ 1. Then, n = 6, G = A (r ) 6 for some r , s ≥ 1 and G is a relation group. Moreover, G ∈ R * , with the exception of G = A 6 || ψ A 6 which fails to have a regular set.
Proof It is well known [4] that the only alternating group A n having a nonpermutation automorphism is A 6 and that the index [Aut(A 6 ) : P Aut(A 6 )] = 2, which means that up to permutation automorphisms there is only one nonpermutation automorphism in A 6 . Hence, G = A (r ) 6 (which is excluded by our assumption) or G = A (r ) 6 || ψ A (s) 6 . We prove that the latter is a relation group.
First, consider G = A 6 || ψ A 6 . Using GAP, we find a nonpermutation automorphisms ψ of A 6 given by the images of generators of A 6 : (Note that this mapping cannot be obtained by permuting points). This may be used to form the group G = A 6 || ψ A 6 as one generated by Unfortunately, we cannot use Lemma 5.2 to complete the proof, because as one can check, A 6 || ψ A 6 has no regular set. So we still need to consider the group G = A (2) 6 || ψ A 6 . This group has regular sets of all sizes from 4 to 20, and it is a relation group. The latter can be checked analogously, as the previous case. We take = 1 ∪ 2 ∪ 3 , where 3 = {1 , . . . , 6 }. We form a defining relation for G using the relation R for G. We define R = R ∪ { } ∪ {{1 , 1 }, . . . , {6 , 6 }}. It is easy to check that G = G(R ). Now, using Lemmas 3.2 and 5.2 completes the proof. Now we consider the groups from the list L introduced in Lemma 3.6. We show that although these groups have no regular sets, their sums have. First we prove the following Lemma 5.5 For each group H in the list L, and each r ≥ 2, H (r ) ∈ R * .
Proof In view of Lemma 5.2, it is enough to prove the claim for r = 2. First assume that H = P SL (2,8). Then, by Lemma 3.6, H is a relation group. Let n be the degree of H , = {1, 2, . . . , n}, and = {1 , 2 , . . . , n }. Then, since H is a relation group, there is a relation R 1 on with sets of cardinality less than n such that H = G(R 1 ).
Let Q be the relation defined in the proof of Lemma 5.3 for r = 2 transferred into the set ∪ by using the natural bijection. The relation Q is to guarantee the parallel action on the sets and . Yet, the arities of Q and R 1 may not be disjoint. Therefore, we replace Q by the family R 2 of the complements of the sets in Q. Then, ar(R 2 ) = {2n −1, 2n −2}. Since 2n −2 ≥ n (as | | ≥ 2), ar(R 1 )∩ar(R 2 ) = ∅. This guarantees the parallel action on the sets and , as well. Hence, putting R = R 1 ∪ R 2 , it follows that G(R) preserves both R 1 and R 2 , which means that G(R) = H (2) , as required.
To apply Lemma 3.2, we need to find a regular set y in H (2) of cardinality n ≤ |y| ≤ 2n − 3. Note that if we find a regular set z of cardinality 3 ≤ |z| ≤ n, then the set y = ( ∪ ) \ z is also regular, and has cardinality 2n − 3 ≥ |y| ≥ n, as required. It follows that all we need is to show that in each case there exists a regular set y of cardinality 3 ≤ |y| ≤ 2n − 3. This can be done easily with GAP. To provide easy checking for the reader, we give some details of computations.
The proof in other cases is the same. The only change is in the choice of permutations g and h generating H , and the regular set y. These details are given in Table 1 for each of the cases H = P SL (2,8).
It remains to consider the case when H = P SL (2,8) acting on n = 9 elements. Since it is not orbit closed, we need to apply another approach. First of all we consider a larger group S (2) 9 ⊇ H (2) that is a relation group. We have S where R 2 is a relation defined in the first part of the proof, for n = 9 in this case.
We also need to consider subdirect sums of elements from L that arise by using a nonpermutation automorphism. It is easy to check that the groups in L having nonpermutation automorphisms are the following: Moreover, one may also check that the index [Aut(G) : P Aut(G)] = 2 in each of these cases. We use this to prove the following. Proof Again, in view of Lemma 5.2, it is enough to prove the claim for r = 2. In view of the remarks above we may restrict to groups H ∈ L * and to one nonpermutation automorphism ψ in each case. We prove the existence of a relation R such that G = H || ψ H = G(R) and it has a regular set y with |y| / ∈ ar(R). By Lemma 5.2, this implies that G ∈ R * , as required.
As in the proof of Lemma 5.4, first we find a nonpermutation automorphism of H . For H = L 3 (2), using GAP, one can find nonpermutation automorphism ψ given by the images of generators Since H is transitive, one may assume that no singleton belongs to R 0 . Also we may assume that {1, . . . , 7} / ∈ R 0 . Let R 0 be a copy of R 0 on {1 , . . . , 7 }.
It is easy to check that G = G(R) and that G has regular sets of all sizes from 4 to 10. Since ar(R) ⊆ {2, . . . , 7}, the claim follows.

Now, the defining relation for
In the next lemma, we consider the last case needed to prove our main result. For each pair, we apply the same strategy, similarly to that in the proof of Lemma 5.5. The main difference is that in the case of G = H ||K we have no larger relation group in the form of parallel sum. Instead, we look for the smallest direct sum H ⊕ K containing H ||K such that we may easily see that H ⊕ K is the relation group.
Let H and K act on disjoint sets 1 and 2 , and let = 1 ∪ 2 . We take the least groups H and K such that H ≤ H ≤ Sym( 1 ), K ≤ K ≤ Sym( 2 ), and H , K are relation groups. Let R 1 and R 2 be relations on 1 and 2 such that H = G(R 1 ) and K = G(R 2 ). As we observed in Section 2, we may assume that 1 ∈ R 1 or not, and 2 ∈ R 2 or not. Without loss of generality, we assume that H and K are ordered so that | 1 | ≥ | 2 |, and 1 ∈ R 1 , while 2 / ∈ R 2 .
We note that the group G = L 2 (5)||A 5 is unique up to permutation isomorphism. This is because A 5 has only permutation automorphism (even if L 2 (5) has a nonpermutation automorphism). The situation is similar in the remaining cases (one of the groups has only permutation automorphisms), so we make no further mention about it.
We explain the details of finding a set x defining G in H ⊕ K . We make use of the fact that the sets in R are all contained in one of the orbits defined by R . Therefore, any set that has elements in each of the orbits certainly does not belong to R . By trial and error, using GAP, we check the set x = {1, 3, 7, 9}. Its cardinality may belong to ar(R ), but by the remark above, the orbit x G is certainly disjoint with R , and therefore to check that G = G(R), similarly as in the proof of Lemma 3.2, it is enough to check that the stabilizer of the family x G in L 2 (5) ⊕ S 5 acting on subsets of is precisely the group G. This is easily done using GAP. Finally, we check that x is actually a regular set in G. Therefore, to apply Lemma 5.2, as a regular set y with |y| / ∈ ar(R) one may take simply the complement of x in , whose cardinality is |y| = 7 > 6 = | 1 |, as required.
In case (ii), we take G = L 2 (7)||L 3 (2), H = L 2 (7), and K = L 3 (2). Generally, in other cases we take H = H and K = K except when H = A n , in which case we take H = S n . This guarantees that in each case H , K are relation groups.
As the generators of L 2 (7) ⊕ L 3 (2), we take the set As the defining set, we take x = {1, 3, 5, 10, 12, 14}, and as a regular set y the complement of x in . The other details of computations (to check by the reader) are the same as before. In Table 2, we list the sets of generators and sets x and y for the remaining three cases. We note that in the last entry the set x is not regular in L 4 (2)||A 8 , and therefore, rather than taking the complement of x, we find another regular set whose complement

Results
Now, we are ready to state and prove our main results. Since a simple permutation group G may have fixed points, we will consider the restriction G of G to those points that are not fixed by G. (i) G = A (r ) n , where n ≥ 3 (n = 4), r ≥ 1, and r < log 2 (n); (ii) G = C 5 or G = P SL (2,8).
In cases (i) and (ii) above, G is not orbit closed.

Proof
In the proof, we assume that G = G has no fixed points. The result extends on groups with fixed points by remarks at beginning of Section 5.
First, if G is primitive, then using [7, Theorem 4.2, Corollary 4.3] we infer that G is a relation group, unless it is A n , C 5 or L 2 (8). If G = A n or C 5 , then we know it is not orbit closed. If G = P SL (2,8), then it is set-transitive ( [2,7]), so it is not orbit closed, either.
If G is transitive imprimitive, then the result is by Proposition 3.1: all groups belong to R * .
Thus, we may assume that G is intransitive, and by Proposition 5.1 (and the following remarks), G is a parallel sum of at least two transitive components, all abstractly isomorphic to G.
If none of the components is orbit closed, then all they are permutation isomorphic to one of the groups pointed out above. Hence, either G = H (r ) or G = H (r ) || ψ H (s) , with ψ induced by a nonpermutation automorphism of H , where H = A n (n = 4), C 5 , or P SL (2,8).
In the latter case, since C 5 and P SL (2,8) have only permutation automorphisms, H = A n , and the claim follows by Lemma 5.4. (We note, for future reference, that G ∈ R * , with the exception of A 6 || ψ A 6 .) In the former case, if H = A n , then by Lemma 5.3, G is a relation group if and only if 2 r ≥ n, and otherwise G is not orbit closed. If H = C 5 , then by [6] (cf. [19,Theorem 6.1]), H r is a relation group for any r > 1. Finally, if H = P SL (2,8), then by Lemma 5.5, G = H (r ) ∈ R * for any r ≥ 2.
Hence, we may assume now that at least one transitive component H of G is a relation group. If H has a regular set y, then by Lemma 5.2, G ∈ R * . If H has no regular set, and G = H (r ) is a parallel multiple, then G ∈ R * by Lemma 5.5. If G is a parallel sum of r > 1 copies of H different from G = H (r ) , then the same holds by Lemma 5.6.
It remains to consider the situation when G has two transitive components H and K that are not permutation isomorphic, but are abstractly isomorphic, H is a relation group, and H has no regular set. By Proposition 3.1, H is primitive and belongs to the list L. For the other component K we may assume that either it is not a relation group (in which case the only possibility is K = A n for some n), or it is a relation group and has no regular set (in which case it appears in the list L). Looking for the list L (preceding Lemma 3.6) we see that there are exactly five possibilities for H and K , and combining Lemmas 5.7 and 5.2 we obtain that, in any case, G ∈ R * .
In the proof above, there is a lot of information on regular sets. Some extra arguments yield the complete description. Theorem 6.2 Let G be a simple permutation group, and G the restriction of G to the points that are not fixed. Then, G has a regular set if and only if G is not one of the following: n , where n ≥ 3 (n = 4), r ≥ 1, and r < log 2 (n − 1); (ii) G is primitive and appears in the list L in Lemma 3.6; (iii) G = A 6 || ψ A 6 is the exceptional group considered in Lemma 5.4.
Proof We assume again that G = G has no fixed points, since it is easy to see that the result extends immediately. The proof follows exactly the proof of the preceding theorem, with one place requiring more consideration.
If G is primitive that the result is by [21] (cf. [7, Theorem 2.2]). If G = H (r ) || ψ H (s) , with ψ induced by a nonpermutation automorphism of H , where H = A n , then the claim follows by Lemma 5.4.
If G = H (r ) and H = A n , then we need to show, in addition, that for n = 2 r + 1, G has a regular set, and if 2 r < n − 1, then G has no regular set. Indeed, G acting on a set has a regular set if and only if there is a partition of into two sets such that no nontrivial permutation in G preserves this partition. Since A (r ) n acts on = 1 ∪ . . . ∪ r , where each i is a copy of {1, . . . , n}, and the action of g (r ) is the same on all copies as the action of g ∈ A n on {1, . . . , n}, the union of partitions of all i into two sets is equivalent to a partition of {1, . . . , n} into 2 r sets (or less if some partitions of i coincide). Now, if n = 2 r + 1, then one can choose partitions of the sets i equivalent to a partition of {1, . . . , n} consisting of a two element set and n − 2 singletons. Obviously, the only permutation in A n preserving this partition is the identity. A regular set y in A (r ) n is the union of blocks, one from each partition of i . If 2 r < n − 1, then any partition of {1, . . . , n} equivalent to partitions of i contains either a block with 3 elements or two 2-element blocks. Then, there exists a nontrivial g ∈ A n preserving this partition, and therefore, A (r ) n has no regular set.
Using the above result, one can determine the distinguishing numbers for simple permutation groups. This was done much earlier for the larger class of almost simple groups in [23], using quite different methods. In turn, these results have been applied in [15] to determine the distinguishing index for graphs with simple automorphism groups.
Finally, we also have a general result concerning subgroups of simple permutation groups. Note that C 5 is not orbit closed, and the same concerns its direct sum with m fixed points C 5 ⊕ I m . Now, C 5 ⊕ I 1 is a subgroup of P SL (2,5), and more generally C 5 ⊕ I m+1 is a subgroup of P SL (2,5) ⊕ I m , m > 0. This is exceptional with regard to the following.

Theorem 6.3 If a simple permutation group G is a relation group, then every subgroup
H < G is a relation group with the exception of H = C 5 ⊕ I 1 < P SL (2,5) or more generally, H = C 5 ⊕ I m+1 < P SL (2,5) ⊕ I m (m > 0).
Proof Again we assume that G has no fixed points and follow the proof of Theorem 6.1. The most involved is now the case of primitive groups. By Lemma 3.1 (ii) [7], if G is a subgroup of group H that has a regular set, is not set-transitive, and is maximal in S n with respect to this property, then every subgroup of H (and thus G) is a relation group, as required. By [2] (cf. [7, Lemma 2.1]), the only set-transitive simple primitive group not containing A n is P SL (2,8), which is not a relation group. So, we need to check those simple groups G that are subgroups of primitive groups that have no regular sets. This requires quite substantial computation, which has been performed in [14]. By the theorem proved in [14], the only subgroup of a simple primitive group which is not a relation group is just H = C 5 ⊕ I 1 < P SL (2,5).
Further, following the proof of Theorem 6.1, the only case we need still to consider, when it is not proved that G ∈ R * , are those with G = (C 5 ) (r ) or (in view of Lemma 5.4) G = A 6 || ψ A 6 with a nonpermutation automorphism ψ. In the former case, G has no nontrivial subgroups, so there is nothing to prove. In the latter case, it is enough to observe that A 6 || ψ A 6 is a subgroup of M 12 , whose all subgroups are relational groups by [14].

Remark
In the first part of the proof, for primitive G, we have used ideas of the proof [7,Theorem 4.1]. Yet, there is a mistake in the proof of this theorem in [7]. The argument there works only for | | > 32. Nevertheless, the theorem is true as it is shown in [14], where a stronger version of it is proved.
Data availability Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.