On the EKR-module Property
Abstract.
In the recent years, the generalization of the Erdős-Ko-Rado (EKR) theorem to permutation groups has been of much interest. A transitive group is said to satisfy the EKR-module property if the characteristic vector of every maximum intersecting set is a linear combination of the characteristic vectors of cosets of stabilizers of points. This generalization of the well-know permutation group version of the Erdős-Ko-Rado (EKR) theorem, was introduced by K. Meagher in [23]. In this article, we present several infinite families of permutation groups satisfying the EKR-module property, which shows that permutation groups satisfying this property are quite diverse.
1. Introduction
The Erdős-Ko-Rado (EKR) theorem [12] is a classical result in extremal set theory. This celebrated result considers collections of pairwise intersecting -subsets of an -set. The result states that if , for any collection of pairwise intersecting -subsets, the cardinality . Moreover in the case , if , then is a collection of -subsets containing a common point. (When , the collection of -subsets that avoid a fixed point, is also a collection of pairwise intersecting subsets.) From a graph-theoretic point of view, this is the characterization of maximum independent sets in Kneser graphs.
There are many interesting generalizations of this result to other classes of objects with respect to certain form of intersection. One such generalization given by Frankl and Wilson [14] considers collections of pairwise non-trivially intersecting -subspaces of a finite -dimensional vector space, which corresponds to independent sets in -Kneser graphs. The book [17] is an excellent survey, including many generalizations of the EKR theorem.
In this article, we are concerned with EKR-type results for permutation groups. The first result of this kind was obtained by Deza and Frankl [13], who investigated families of pairwise intersecting permutations. Two permutations are said to intersect if the permutation fixes a point. A set of permutations is called an intersecting set if fixes a point for any two members and of the set. Clearly the stabilizer in of a point or its coset is a canonically occurring family of pairwise intersecting permutations, of size . In [13], it was shown that if is a family of pairwise intersecting permutations, then . In the same paper, it was conjectured that if the equality is met, then has to be a coset of a point stabilizer. This conjecture was proved by Cameron and Ku (see [8]). An independent proof was given by Larose and Malvenuto (see [20]). Later, Godsil and Meagher (see [15]) gave a different proof. A natural next step is to ask similar questions about general transitive permutation groups.
Let be a finite group acting transitively on a set . An intersecting subset of with respect to this action is a subset in which any two elements intersect. Obviously, a point stabilizer , its left cosets , and right cosets are intersecting sets, which we call canonical intersecting sets. An intersecting set of maximum possible size is called a maximum intersecting set. Noting that the size of a canonical intersecting set is , we see that the size of a maximum intersecting set is at least . It is now natural to ask the following:
(A) Is the size of every intersecting set in bounded above by the size of a point stabilizer?
(B) Is every maximum intersecting set canonical?
As mentioned above, the results of Deza-Frankl, Cameron-Ku, and Larose-Malvenuto show that the answer to both these questions in positive for the natural action of a symmetric group. However, not all permutation groups satisfy similar properties, although there are many interesting examples that do. We now formally define the conditions mentioned in the above questions.
Definition 1.1.
A transitive group on is said to satisfy the EKR property if every intersecting set has size at most , and further said to satisfy the strict-EKR property if every maximum intersecting set is canonical.
When the action is apparent, these properties will be attributed to the group. We have already seen that the natural action of satisfies both the EKR and the strict-EKR property. EKR properties of many specific permutation groups have been investigated (see [1, 3, 22, 25, 26, 27]). In particular, it was shown that all -transitive group actions satisfy the EKR property, see [25, Theorem 1.1], but not every 2-transitive group satisfies the strict-EKR property; for instance, with respect to the -transitive action of (with ) on the 1-spaces, the stabilizer of a hyperplane is also a maximum intersecting set. However, it is shown in [25] that -transitive groups satisfy another interesting property called the EKR-module property, defined below.
For a transitive group on and a subset , let
the characteristic vector of in the group algebra . For and with , we write
the characteristic vector of the canonical intersecting set , which we call a canonical vector for convenience. The next definition was first introduced in [23].
Definition 1.2.
A finite transitive group on a set is said to satisfy the EKR-module property if the characteristic vector of each maximum intersecting set of on is a linear combination of canonical vectors, that is, the vectors in .
The name is from the so called “module method” described in [2]. We remark that
-
(a)
a group action satisfying the strict-EKR property also satisfies the EKR-module property, but the converse statement is not true;
- (b)
Example 1.3.
Consider the action of on the set of cosets of a subgroup . We observe that the Sylow 2-subgroup of is an intersecting set. As , this action does not satisfy the EKR property. Consider an intersecting set . Then given , the set is an intersecting set containing the identity. By the definition of an intersecting set, we have . This shows that any maximum intersecting set must be coset of . Any coset of is a union of two disjoint cosets of , and thus this action satisfies the EKR-module property.
We will now construct an example of a group action that satisfies the EKR property, but not the EKR-module property. Prior to doing so, we mention a well-known result. Consider a transitive action of a group on a set . A subset is said to be a regular subset, if for any , there is a unique such that . Corollary 2.2 of [3] states that permutation groups which contain a regular subset, satisfy the EKR property.
For a group and a subgroup , let
the set of left cosets of in . Then acts transitively on by left multiplication. Moreover, each transitive action of a group is equivalent to such a coset action.
Example 1.4.
Consider (isomorphic to ) and a subgroup isomorphic to the dihedral group of size 12. We consider the action of on . We first show that this action satisfies the EKR property, by demonstrating the existence of a regular subset. We consider the cyclic subgroup and the -cycle . We claim that is a regular set. As , this claim will follow by showing that for with , we have , for all . This is equivalent to showing that , for all . It is easy to verify that for any two distinct , is either a -cycle or a -cycle, and thus . We can now conclude that is a regular subset. Therefore, by [3, Corollary 2.2], satisfies the EKR property. Thus the size of any intersecting set is bounded above by .
Now we consider subgroup of . It is easy to check that and thus is a maximum intersecting set. In this case, canonical intersecting sets are cosets of a conjugate of . Every canonical intersecting set contains exactly even permutations. Also every permutation in is even. Now consider the sign character . For every canonical intersecting set , we have . On the other hand, we have . From this, we see that cannot be a linear combination of the characteristic vectors of the canonical intersecting sets. Therefore this action does not satisfy the EKR-module property.
We will now describe the main results of our paper.
1.1. Main Results
Our first result is a characterization of the EKR-module property of a group action, in terms of the characters of the group in question. Given a group , a complex character of , and a subset , by , we denote the sum . We now describe our first result, a characterization of the EKR-module property in terms of character sums.
Theorem 1.5.
Let be a finite group, , and . Let , and be the collection of maximum intersecting sets in . Then on satisfies the EKR-module property if and only if for any and any .
We note that Example 1.4 can be viewed as an application of the above result. In Example 1.4, the sign character is a character such that . However, for the maximum intersecting set , we have . Thus by Theorem 1.5, the action in Example 1.4 does not satisfy the EKR-module property.
Given an action of on , the derangement graph is the graph whose vertex set is , and vertices are adjacent if and only if does not fix any point in . Then a set is an intersecting set if and only if it is an independent set in . Therefore, the study of intersecting sets could benefit from the various results from spectral graph theory about independent sets. Many authors (for instance, see [26], [27]) have studied the EKR and strict-EKR properties of various group actions from this point of view. Theorem 3.4 is a characterization of the EKR-module property of a group action in terms of spectra of weighted adjacency matrices of the corresponding derangement graph.
It is well known (see [3, Corollary 2.2]) that permutation groups with regular subsets satisfy the EKR property. However, as observed in example 1.4, such groups do not necessarily satisfy the EKR-module property. The following theorem shows that every permutation group with a regular normal subgroup satisfies the EKR-module property.
Theorem 1.6.
Transitive groups actions with a regular normal subgroup satisfy the EKR-module property.
A few classes of permutation groups with a regular normal subgroup are Frobenius groups, affine groups, primitive groups of type HS, HC, and TW (for a description of these, we refer the reader to [28]).
After showing that all -transitive groups satisfy the EKR-module property, the authors of [25] mention that the next natural step is to consider rank permutation groups. As a first step, we consider this problem for the class of primitive rank permutation groups. The next theorem reduces the problem to almost simple groups. (Recall that a finite group is called almost simple if it has a unique minimal normal subgroup, which is non-abelian and simple.)
Theorem 1.7.
Let be a primitive permutation group on of rank . Then either has the EKR-module property, or is an almost simple group.
We would like to mention that when is sufficiently large, the rank action of on -subsets of , satisfies the strict-EKR property, and thereby the EKR-module property. This was proved in [11]. Example 1.4 shows that this fails when .
In [6], a finite group is defined to satisfy the weak EKR property, if every transitive action of satisfies the EKR property. A finite group is defined to satisfy the strong EKR property, if every transitive action of satisfies the strict-EKR property. Theorem of [6] shows that nilpotent group satisfies the weak EKR property. This result was extended to supersolvable groups in [21]. It is easy to check that every abelian group satisfies the strong EKR property. Theorem of [6] states that a finite non-abelian nilpotent group satisfies the strong EKR property if and only if it is a direct product of a -group and an abelian group of odd order. We now make the following analogous definition.
Definition 1.8.
A finite group is said to satisfy the EKR-module property if every transitive action of satisfies the EKR-module property.
As mentioned before, groups with the strict-EKR property have the EKR-module property. It is then natural to ask whether the converse statement is true or not. It is shown in [6, Theorem 3] that there are infinitely many nilpotent groups of nilpotency class that do not satisfy the strict-EKR property. The next result then answers the question in negative.
Theorem 1.9.
Nilpotent groups of nilpotency class satisfy the EKR-module property.
It is shown in [6, Theorem 2] that a group satisfying the EKR property for every transitive action is necessarily solvable. However, it is shown in Lemma 6.2 that there do exist non-solvable groups which have the EKR-module property.
An analogue of the EKR-module property has been observed in other generalizations of the EKR theorem. Consider a graph and a prescribed set of “canonically” occurring cliques. We say that the graph satisfies the EKR-module property, if the characteristic vector of any maximum clique is a linear combination of the characteristic vectors of the canonical cliques. In the context of permutation groups satisfying the EKR-module property, the complement of the corresponding derangement graph satisfies the EKR-module property. In Chapter 5 of [17], there are a few examples of strongly regular graphs satisfying the EKR-module property. In [4], the authors show that Peisert-type graphs satisfy the EKR-module property. Let be an odd prime power. Let and be finite fields of order and respectively. A Peisert-type graph of type is a Cayley graph of the form , where the “connection” set is a union of distinct cosets of the multiplicative group in . It is clear that any set of the form , with and , is a clique. We deem these to be the canonical cliques. In [4], the authors show that characteristic vector of any maximum clique in a Peisert-type graph, is a linear combination of the characteristic vectors of canonical cliques. In § 7, we give a shorter independent proof of the same.
2. EKR-module property and character theory.
In this section, we gather some tools which are used to prove our main results, and then prove Theorem 1.5.
Let be the kernel of on . Here for some . The following simple lemma shows that we may assume without loss of generality that is trivial.
Lemma 2.1.
Let be the natural quotient map. Then a subset is a maximum intersecting set of if and only if is a maximum intersecting set of .
Proof.
Given an intersecting set , we note that is also an intersecting set. So any maximum intersecting set in must be a union of -cosets. Let be such that is a maximum intersecting subset of . We see that is an intersecting set in .
Now consider a maximum intersecting set of . It is clear that is an intersecting set. So we have , and . This shows that (respectively ) is a maximum intersecting set of (respectively ). ∎
As an immediate consequence, we get the following corollary.
Corollary 2.2.
Let be a finite transitive group on with kernel , and let be the natural quotient map. Then the following hold:
-
(i)
satisfies the EKR (respectively strict-EKR) property if and only if satisfies the EKR (respectively strict-EKR);
-
(ii)
satisfies the EKR-module property if and only if satisfies the EKR-module property.
Proof.
Set . We note that for all and , we have and . The proof now follows from Lemma 2.1. ∎
For any , we denote by the subgroup . Given , we have . Thus, with respect to this action, we see that the set is the set of canonical intersecting sets. By , we denote the subspace of spanned by the set of the characteristic vectors of the canonical intersecting sets. By the definition of the EKR-module property, the action of on satisfies the EKR-module property if and only if for every maximum intersecting set in .
We observe that for every , we have . Therefore, is a two-sided ideal of the group algebra . The two-sided ideals of complex group algebras are characterized by the Artin-Wedderburn decomposition.
We will now recall some basic facts on group algebra, proofs of which can be found in any standard text on representation theory such as [19]. Let be the set of irreducible complex characters of . For , we define , where are the right submodules of that afford the character . By Maschke’s theorem, we have the decomposition
For each , we have and that is a minimal two-sided ideal containing the primitive central idempotent
By orthogonality relations among characters, we have
(1) |
Using the fact that is a semi-simple algebra, we now get the following description of two-sided ideals of
Lemma 2.3.
Given a two-sided ideal of , there is a subset such that .
Our investigation of the EKR-module property of the action of on , will benefit from the description of as a direct sum of simple ideals of . We recall that , is the subspace of spanned by the set . We also showed that it is a two-sided ideal.
Lemma 2.4.
Let be a finite group, a subgroup, and be the space of left cosets of . Let . Then, the linear span of decomposes as the sum of simple ideals of .
Proof.
For any subset and , we have
Therefore for any , we have . As is a minimal ideal, we conclude that .
Now consider . In this case, we have . Let be a unitary representation affording as its character. Given a subset , we define . As is a unitary representation, we have , that is, is the conjugate transpose of . Now given , we have
As , we have . Since , this can only happen when . Therefore, , and we conclude that . Thus annihilates . As , cannot be an element of the ideal . Now the result follows by applying Lemma 2.3 and equation (1). ∎
As an immediate application, we obtain a significantly shorter proof of Lemma 4.1 and Lemma 4.2 of [2]. The content of these two results is presented as the following corollary. We will use the following technical result in the proof of Theorem 1.7. We would like to mention that it was a key result that led to the “Module Method” described in [2].
Corollary 2.5.
Let be a -transitive permutation group with such that is the corresponding permutation character. Given , set and . Then
-
(1)
is a vector space of dimension ;
-
(2)
and the set
is a basis set of for any .
Proof.
Part (1) follows immediately from Lemma 2.4.
We observe that for , we have . Therefore, every vector of the form is in the linear span of the elements of , and thus spans . Linear independence follows as is a -dimensional subspace. ∎
We are now ready to prove Theorem 1.5.
Proof of Theorem 1.5: Given , by Lemma 2.4 and (1), we have , for all . By the definition of the EKR-module property, for any maximum intersecting set , we have . The equality follows from .
We now prove the other direction. Suppose that for any and any maximum intersecting set , we have . Fix a maximum intersecting set . If is a maximum intersecting set, then so is , for all . Therefore, , for all and all . Thus , for all . Further, by the equality , we have
By Lemma 2.4, . Since is an ideal, we have . Thus the EKR-module property is satisfied. ∎
We note that if is a maximum intersecting set, then for any , the set is a maximum intersecting set that contains the identity element. So every maximum intersecting set is a “translate” of an intersecting set containing the identity. The following corollary shows that, as far as the EKR-module property is concerned, we can restrict ourselves to maximum intersecting sets containing the identity.
Corollary 2.6.
Let be a finite group with the identity , , and . Let , and
Then on satisfies the EKR-module property if and only if for any and any .
Proof.
At first, we assume that , for all and . Fix a and a maximum intersecting set . Let be a unitary representation affording as its character. Given a set , define . We observe that . Then . As is a unitary representation, is the conjugate transpose of , and thus
(2) |
For any , the set is a maximum intersecting set containing the identity . Therefore, we have , for all . Thus by (2), we have . As is the conjugate transpose of , the matrix is a diagonal matrix whose entries are the norms of rows of . Thus, implies that . We can now conclude that . By Theorem 1.5, the action of on satisfies the EKR-module property.
The other direction follows directly from Theorem 1.5. ∎
3. EKR-module property and Spectral graph theory.
Results from spectral graph theory have proved useful in characterizing maximum intersecting sets in some permutation groups (for instance, see [25], [26], [27]). Let be a group acting on , for some . An element is called a derangement if it does not fix any point in . Let denote the set of derangements in . It is easy to see that . By , we denote the Cayley graph on , with as the “connection set”. We now observe that intersecting sets in are the same as independent sets/co-cliques in . This observation enables us to use some popular spectral bounds on sizes of independent sets in regular graphs. Before describing these, we recall some standard definitions.
For graph on vertices, a real symmetric matrix whose rows and columns are indexed by the vertex set of , is said to be compatible with , if whenever is not adjacent to in . Clearly, the adjacency matrix of is compatible with . Given a subset of the vertex set, by , we denote the characteristic vector of . We now state the following famous result which is referred to as either the Delsarte-Hoffman bound or the ratio bound.
Lemma 3.1.
([17, Theorem 2.4.2]) Let be a real symmetric matrix with constant row sum , which is compatible with a graph on vertices. If the least eigenvalue of is , then for any independent set in ,
and if equality holds, then
is a -eigenvector for .
The application of the above lemma on clever choices of -compatible matrices, proved useful in characterization of maximum intersecting sets for many permutation groups (for instance see [26] and [27]). We will now describe these in detail.
Definition 3.2.
Let be a group acting transitively on a set . A -compatible class function is a real valued class function such that: (i) for all ; and (ii) for all .
Let be a -compatible class function . Consider the matrix indexed by , that satisfies for all . Clearly is a -compatible matrix. We now describe the spectra of such matrices. The description of spectra of matrices of the form is a special case of well-know results by Babai ([5]) and Diaconis-Shahshahani ([10]). The following lemma, which is a special case of Lemma 5 of [10], describes the spectra of matrices of the form .
Lemma 3.3.
(Babai, Diaconis-Shahshahani) Let be a permutation group on , with being the set of derangements. Let be -compatible class function. Define to be the matrix satisfying , for all . Then is a -compatible matrix with spectrum , where
Given , the -eigenspace in is the two-sided ideal
We are now ready to give a sufficient condition for EKR-module property in terms of spectra of -compatible matrices. Let be a -compatible class function. Then the row sum of is . Let be the least eigenvalue of . By Lemma 3.1, for any intersecting set , we have
Let us assume that equality holds for some intersecting set . By Lemmas 3.1 and 3.3, if is an maximum intersecting set, then is in the -sided ideal
Now by application of Lemma 2.4, we obtain the following sufficient condition for EKR-module property.
Theorem 3.4.
Let be a group acting on the set of left cosets of a subgroup . Assume that there is an intersecting set and a -compatible class function such that , where and is the least eigenvalue of . Then
(a) is the size of a maximum intersecting set in ; and
(b) the action of on satisfies the EKR-module property if
4. Proof of Theorem 1.6
In this section, we prove Theorem 1.6. By Corollary 2.2, we can restrict ourselves to permutation groups that contain a regular normal subgroup. Let be a finite group and . We consider the permutation action of on , defined by , for all and . It is well-known that any permutation group with a regular normal subgroup, is of the form . By [1, Corollary 2.2], permutation groups which contain a regular subgroup, satisfy the EKR property. Thus the action of on satisfies the EKR property.
Before starting the proof, we prove an elementary result that we will use later. Every element of is of the form , where and . Note that . We need the following well-known result for technical reasons.
Lemma 4.1.
Consider , with and . If fixes a point then
(i) is conjugate to via an element of ; and
(ii) is the unique -conjugate of in .
Proof.
For convenience, given , we identify with . Given any , we have . So fixes if and only if .
Now for , we have . Thus if and only if . Then the proof follows from setting . ∎
We will now prove the theorem by using Corollary 2.6. Let be any maximum intersecting set with . As is an intersecting set, for all , the element fixes some point. Thus by Lemma 4.1, given , there exists a unique element and an element , such that . We now claim that . Since satisfies the EKR property, we have . Therefore, is equivalent to injectivity of the map .
Suppose that for some , we have . Then, we have
As is an intersecting set, fixes a point. Since acts regularly, we must have . Thus is injective, and . As is conjugate to , for any , we have . Therefore, if and is a maximum intersecting set containing , we have . Now, by Corollary 2.6, Theorem 1.6 is proved. ∎
5. EKR-module property for primitive rank 3 group actions.
In this section, we study the EKR-module property for primitive permutation groups of rank 3, and prove Theorem 1.7. Let be a primitive permutation group on of rank 3. To prove Theorem 1.7, we may assume that is not an almost simple group. Then either
-
(a)
is affine, so that has a regular normal subgroup, or
-
(b)
is in product action, and on , where is -transitive.
If is affine, then indeed has the EKR-module property by Theorem 1.6. We thus assume further that is in product action in the rest of this section.
Let be a -transitive group, and let , where . Let , and . Then naturally acts on , with . Obviously,
, , and |
are the orbits of on . Thus is of rank .
In view of Corollary 2.6, it is beneficial to obtain descriptions of the set of irreducible characters of , and of the maximum intersecting sets in containing the identity. As one would expect, the -transitive action on plays a major role. Before going any further, we establish some notation. In , by , we denote the unique -cycle in . Elements of are of the form , where . By , we denote the product of elements and of .
We start by describing . The subgroup of is a normal subgroup of index . By Clifford theory ([19, 6.19]), restriction of any irreducible character to is either an irreducible -invariant character of , or the sum of two -conjugate irreducible characters of . From well-known results on characters of direct products, we have
Let be two distinct irreducible characters of , then the inertia subgroup in of is , and therefore is an irreducible character of , with . Now consider an irreducible character of , of the form . Let be a representation affording as its character. Then is a representation of that affords as its character. Let be the unique -cycle in . Define to be the representation such that and for all . The character afforded by is an irreducible character of that extends . We also have for all . By a result of Gallagher ([19, 6.17]), there is exactly one other irreducible character of whose restriction to is , namely , where is the unique non-trivial linear character with kernel . Therefore by Clifford theory any irreducible character is one of the characters defined above.
Lemma 5.1.
The set
is the complete set of irreducible characters of .
We now describe the permutation character for the action on . As is a -transitive group, there is be such that is the permutation character for . Computation shows that is the permutation character for .
The next lemma follows from the proof of Lemma 3.5 of [18], which is essentially the same as Lemma 4.2 of [3].
Lemma 5.2.
Every maximum intersecting set for the action of on is of the form , where and are maximum intersecting sets with respect to the action of on
We now give the following characterization of maximum intersecting sets in .
Lemma 5.3.
The action of on satisfies the EKR property. If is a maximum intersecting set in that contains the identity, then there are maximum intersecting sets , , in such that:
-
(i)
, and
-
(ii)
and contain the identity of .
Proof.
As is a -transitive group, by the main results of [27] and [25], the action of on satisfies both EKR and EKR-module properties. By Lemma 5.2, a maximum intersecting set for the action of on is of the form , where and are maximum intersecting sets in . Therefore, the action of on also satisfies the EKR property. The subgroup of is a transitive subgroup satisfying the EKR property, and so by Lemma 3.3 of [27], we see that the action of also satisfies the EKR property.
We consider a maximum intersecting set with respect to the action of on . We further assume that contains the identity element. With this assumption, every element of must fix a point in . Now and are intersecting sets with respect to the action of on . We note that is a point stabilizer for this action. Since the action of on satisfies the EKR property, we have and . Now since the action of on satisfies the EKR property, is a point stabilizer, and is a maximum intersecting set in , we have . Therefore, both and are maximum intersecting sets in . Using Lemma 5.2, we see that there are maximum intersecting sets , , , in , such that (i) ; and (ii) . As contains the identity of , and must contain the identity of . We will now show that .
Given and , consider the element . As we assume that contains the identity, must fix a point. That is to say, , where and are as described prior to the statement of the lemma. As is the permutation character for the action of on , if and only if fixes a point of . Thus for for a given , the set is an intersecting set in . As is a maximum intersecting set in , we must have . This shows that . ∎
We recall that is the permutation character for the action of on , where is such that is the permutation character for the action of on . By Corollary 2.6, EKR-module property of is equivalent to showing that for all maximum intersecting sets that contain the identity and . Let be a maximum intersecting set in such that . By Lemma 5.3, there are maximum intersecting sets in such that : and contain the identity of ; and . For any distinct pair , we can compute the following character sums:
-
(I)
;
-
(II)
; and
-
(III)
.
We need to compute , for all and all maximum intersecting sets in . To do so, we use the EKR and EKR-module properties of -transitive groups.
Lemma 5.4.
Let be a -transitive group with being the point stabilizer. Let be such that is the permutation character. If is an maximum intersecting set in , then
-
(i)
, when ;
-
(ii)
, provided ; and
-
(iii)
for all irreducible characters .
Proof.
As is 2-transitive, it satisfies both the EKR and EKR-module properties. By Corollary 2.5, is in the ideal . By the orthogonality relations among primitive central idempotents, we see that left multiplication by is a projection onto . That is . Writing both sides as a linear combination of the elements in the basis set of the group algebra , and equating the coefficients of the identity element on both sides, yields the first two formulae.
Part (iii) is a direct consequence of Corollary 2.6. ∎
Pick a maximum intersecting set in such that , and let . Now applying Lemma 5.4 (ii) and the character sum formulas (I) (II) and (III) given above yields that . As are the only irreducibles that contribute to the permutation character for the action of on , in view of Corollary 2.6, we need to show that . This is indeed true by Lemma 5.4, and then Theorem 1.7 follows from an application of Corollary 2.6. ∎
6. Some groups satisfying the EKR-module property.
In this section, we study groups satisfying the EKR-module property. Recall (from Definition 1.8) that a finite group satisfies the EKR-module property if every transitive action of satisfies the EKR-module property. We first prove Theorem 1.9, and then prove the smallest non-abelian simple group satisfies the EKR-module property.
6.1. Proof of Theorem 1.9.
In this subsection, we consider transitive actions of nilpotent groups of nilpotency class . By [6, Theorem 3], all transitive actions of nilpotent groups satisfy the EKR property. In the same paper, it was also shown that there are examples of class- nilpotent groups that do not satisfy the strict-EKR property. We will show that all transitive actions of class- nilpotent groups satisfy the EKR-module property. Our proof is a proof by contradiction.
Recall the following well-known result from character theory.
Lemma 6.1.
Let be a group, an irreducible complex character of , and an element of the centre of . Then for all , we have .
Proof.
Let be a representation affording as its character. As is in the centre, the map is a -module homomorphism. Thus, by Schur’s lemma, acts like a scalar matrix, and thus . ∎
Assume that Theorem 1.9 is false. Let be a class- nilpotent group , and such that the action of on does not satisfy the EKR-module property. We may further assume that is as small as possible. By the minimality of and by Corollary 2.2, the action of on must be a permutation action. In other words, is core-free, that is, . As the action of on does not satisfy the EKR-module property, by Theorem 1.5, there is a character and a maximum intersecting set such that . We fix one such pair .
As is nilpotent, it has a non-trivial centre, which we denote by . Given a character of , we denote its kernel, , by . As every non-trivial normal subgroup of a nilpotent group intersects non-trivially with the centre, we either have , or that is a faithful character.
We first assume that is faithful. As is a class- nilpotent group, we have . Since is non-abelian, given , we can pick be such that . As is faithful, we have . Since , we have . As is a central element, by Lemma 6.1, we have . As , we must have for all . Recall that is core-free, and thus . We can now conclude that . This contradicts our initial condition that , and therefore cannot be faithful.
Now we are left with the case when is not faithful. By , we denote the kernel of a corresponding representation. We set . We note that is a non-trivial normal subgroup of . As is a core-free subgroup, we have , for all . Thus the action of on is semi-regular. If the action of is regular, then it is a regular normal subgroup, and thus by Theorem 1.6, the action of on must satisfy the EKR-module property. As this contradicts our assumption, the action of on must be semi-regular and intransitive. As , the set of orbits on , is a block system for the action of on . Since acts intransitively, we have , and thus . We now consider the transitive action of on . The elements of fix the -orbit containing the element . Observing that , we can conclude that is a stabilizer for the action of on . As is an intersecting set with respect to the action of on , the set is an intersecting set with respect to the action of on . Since is a central semi-regular subgroup in and is an intersecting set, we can conclude that . As we mentioned above, transitive actions of nilpotent groups satisfy the EKR property, and thus since is a maximum intersecting set with respect to the action of on , we have , and therefore . We can now see that is a maximum intersecting set with respect to the action of on . As is a central subgroup, by using Lemma 6.1, we have and . By our choice of and , and . Therefore is a maximum intersecting set with respect to the action of on and is a character in , such that . So by Theorem 1.5, the action of on does not satisfy the EKR-module property. Now since , this conclusion contradicts the minimality of . Therefore our assumption that is not faithful must be false.
Both cases return contradictions, and hence our initial assumption that Theorem 1.9 fails, must be false. This concludes the proof. ∎
Theorem 1.9 and Theorem 3 of [6] establish the existence of infinitely many groups that satisfy the EKR and EKR-module property, but not the strict-EKR property. Theorem 2 of [6] shows that groups that satisfy the EKR property are necessarily solvable. However, the EKR-module property is not so restrictive.
6.2. A group satisfying the EKR-module property is not necessarily solvable
Lemma 6.2.
The simple group satisfies the EKR-module property.
Proof.
Let be a subgroup of . We need to show that the action of on satisfies the EKR-module property. Assume that is a subgroup satisfying
(3) |
Then by Theorem 1.5, the action of on satisfies the EKR-module property. Computation shows that the relation (3) fails if and only if is isomorphic to one of the groups:
(Here denotes the dihedral group of order 10.) We will deal with groups separately.
When is isomorphic to one of or , the action of on is -transitive. Hence by the main result of [25], these group actions satisfy the EKR-module property.
Consider a subgroup . We will use Theorem 3.4 to show that the action of on satisfies the EKR-module property. For this, we need the character table of , which is given as Table 1.
class | |||||
---|---|---|---|---|---|
size | |||||
In this case, the set , of derangements, is the union of the conjugacy class containing and the conjugacy class containing . Let be the -compatible class function satisfying and . Now application of Theorem 3.4 by setting and , yields that this action satisfies the EKR-module property.
Next, we consider a subgroup in and the action of on . The set , of derangements, is the union of the conjugacy class containing , the conjugacy class containing , and the conjugacy class containing . Let be be the -compatible class function satisfying and . Now application of Theorem 3.4, by setting and , yields that this action satisfies the EKR-module property.
Finally, we consider a subgroup in and the action of on . The set , of derangements, is the union of conjugacy classes and . Let be be the -compatible class function satisfying . Let be a subgroup of . As , we see that is an intersecting set with respect to this action. Now, setting and , Theorem 3.4 yields that this action satisfies the EKR-module property. ∎
7. EKR-module property in Strongly Regular Graphs
In the section, we consider maximum cliques in the Peisert-type strongly regular graphs defined in [4]. These are a subclass of strongly regular graphs found in [7]. Consider a strongly regular graph , with a prescribed set of “naturally” occurring cliques. Cliques in will be called canonical cliques. We say that satisfies the EKR-module property with respect to if the characteristic vector of every maximum clique in is a linear combination of characteristic vectors of the cliques in . We now define Peisert-type graphs.
Definition 7.1.
Let be an odd prime power. Then a Peisert-type graph of type is a Cayley graph on the additive group of with its “connection” set being a union of cosets of in such that .
Given a Peisert-type graph of type , with connection set . For any and , the set is a naturally occurring clique. By a canonical clique in a Peiset-type graph, we mean a clique of the form , where and . The main result of [4] is the following shows that Peiser-type graphs satisfy EKR-module property. In this section, we give a shorter and different proof of the same.
Theorem 7.2.
([4, Theorem 1.3]) The characteristic vector of a maximum clique in a Peisert-type graph is a linear combination of characteristic vectors of its canonical cliques.
We now collect some results about Peisert-type graphs and some general results about strongly regular graphs. The main result of [7] shows that Peisert-type graphs are strongly regular. A different proof of the same is given in [4]. We will give a proof using a standard technique of finding eigenvalues of an abelian Cayley graph.
Lemma 7.3.
Peisert-type graph of type is strongly regular with eigenvalues with multiplicity 1, with multiplicity , and with multiplicity .
Proof.
Let a Peisert-type graph of type whose connection set is (with ). Let be the adjacency matrix of . Considering an additive character of of as a column vector, we see that , where .
If is not the trivial character, , and so at most one of can be a subgroup of . Thus if for some , then the restriction of onto the subgroup , is a non-trivial character whenever . Otherwise, will have two -dimensional subspaces of and thus must be equal to .
Assume that is a non-trivial character with . As the sum of values of a non-trivial character are zero, in this case, we have
The set on non-trivial characters with is in one-one correspondence with the non-trivial characters of . Thus there are atleast characters such that . As distinct characters are orthogonal the dimension of the -eigenspace of is atleast .
Similarly, if is a non-trivial character with for all , we have . Thus there are atleast characters such that . As distinct characters are orthogonal the dimension of the -eigenspace of is atleast .
If is the trivial character , we have . With this, we have found all the eigenvalues of and their corresponding eigenspaces. As has exactly three distinct eigenvalues, it is a strongly regular graph. ∎
Let be a strongly regular graph with parameters , which is a -regular graph on vertices such that
-
(i)
any two adjacent vertices have exactly common neighbours, and
-
(ii)
any two non-adjacent vertices have exactly common neighbours.
We further assume that is primitive, that is, both and its complement are connected. It is well known ([16, Lemma 10.2.1]) that the adjacency matrix of has exactly three distinct eigenvalue. As is -regular and connected, is an eigenvalue of with multiplicity . Let with be the other eigenvalues.
Our proof uses some results on graphs in association schemes. For a quick introduction to the preliminaries on graphs in association schemes, we refer the reader to Chapter 3 of [17]. We first recall the following well-known result linking strongly regular graphs with association schemes. By and , we denote the all-one matrix and the identity matrix respectively.
Lemma 7.4.
([17, Lemma 5.1.1]) Let be a graph with as its adjacency matrix. Then is strongly regular if and only if is an association scheme.
By , we denote the linear span of matrices in . This is referred to as the Bose-Mesner algebra. By a well-known result ([17, Theorem 3.4.4]), the projections onto eigenspaces of is an orthogonal basis of idempotents of . The matrix is the projection onto the -eigenspace. We denote and to be the projections onto the -eigenspace and the -eigenspace respectively. We have , , and so is an orthogonal basis of idempotents of . We now mention a bound by Delsarte (see equation of [9]) on cliques in strongly regular graphs. We state the formulation of this result as given in [17, Corollary 3.7.2].
Lemma 7.5.
Let be -regular strongly regular graph with as the least eigenvalue of its adjacency matrix. If is a clique in , then .
Moreover, if is a clique that meets the bound with equality, then the characteristic vector is orthogonal to the -eigenspace.
Given a subset of the vertex set of , by , we denote the characteristic vector of , and by , the all-one vector. Consider the -linear span of characteristic vectors of maximum cliques in . By the above lemma, we have , for any clique . Assume that there is a clique of size , then by the above Lemma, is orthogonal to the -eigenspace. We will now show that is in the image of .
Lemma 7.6.
Let be -regular strongly regular graph on vertices with with as set of distinct eigenvalues of its adjacency matrix. If has a clique of size , then is an -eigenvector.
Proof.
From Lemma 7.5, we have . As is a -eigenvector, it is also orthogonal to the -eigenspace. Since , the vector is orthogonal to both the -eigenspace and the -eigenspace, and so must lie in the -eigenspace. ∎
We are now ready to prove Theorem 7.2.
Proof of Theorem 7.2: Let be a Peisert-type graph of type whose connection set is (with ). By Lemmas 7.3, 7.5 and 7.6, we obtain the next result.
Lemma 7.7.
If is a maximum clique in , then and is a -eigenvector.
Thus, given and , the canonical clique is a maximum clique and is a -eigenevector. By Lemma 7.3, the dimension of the )-eigenspace is . Using the above Lemma, we can now deduce that Theorem 7.2 follows from showing that spans an dimensional vector space.
Given an additive character of , we set . In the proof of Lemma 7.3, we see that the -eigenspace , is spanned by
Let . Then we have
By , we denote the natural orthogonal form on . With respect to this form, we have . If is a non-trivial character, then
Therefore, for all . We will now show that vectors of the form span . Considering and . As the set is a set of orthogonal vectors, the set spans a dimensional vector space. Therefore spans . Thus spans . This concludes the proof of Theorem 7.2. ∎
References
- [1] Bahman Ahmadi and Karen Meagher. A new proof for the Erdős–Ko–Rado theorem for the alternating group. Discrete Mathematics, 324:28–40, 2014.
- [2] Bahman Ahmadi and Karen Meagher. The Erdős-Ko-Rado property for some 2-transitive groups. Annals of Combinatorics, 19(4):621–640, 2015.
- [3] Bahman Ahmadi and Karen Meagher. The Erdős-Ko-Rado property for some permutation groups. Australasian Journal of Combinatorics, 61(1):23–41, 2015.
- [4] Shamil Asgarli, Sergey Goryainov, Huiqiu Lin, and Chi Hoi Yip. The EKR-module property of pseudo-Paley graphs of square order. The Electronic Journal of Combinatorics, 2022.
- [5] László Babai. Spectra of Cayley graphs. Journal of Combinatorial Theory, Series B, 27(2):180–189, 1979.
- [6] Mohammad Bardestani and Keivan Mallahi-Karai. On the Erdős–Ko–Rado property for finite groups. Journal of Algebraic Combinatorics, 42(1):111–128, 2015.
- [7] Andries E Brouwer, Richard M Wilson, and Qing Xiang. Cyclotomy and strongly regular graphs. Journal of Algebraic Combinatorics, 10(1):25–28, 1999.
- [8] Peter J Cameron and Cheng Yeaw Ku. Intersecting families of permutations. European Journal of Combinatorics, 24(7):881–890, 2003.
- [9] Philippe Delsarte. An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl., 10:vi+–97, 1973.
- [10] Persi Diaconis and Mehrdad Shahshahani. Generating a random permutation with random transpositions. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 57(2):159–179, 1981.
- [11] David Ellis. Setwise intersecting families of permutations. Journal of Combinatorial Theory, Series A, 119(4):825–849, 2012.
- [12] Psul Erdős, Chao Ko, and Richard Rado. Intersection Theorems for systems of finite sets. The Quarterly Journal of Mathematics, 12(1):313–320, 01 1961.
- [13] Peter Frankl and Mikhail Deza. On the maximum number of permutations with given maximal or minimal distance. Journal of Combinatorial Theory, Series A, 22(3):352–360, 1977.
- [14] Péter Frankl and Richard M Wilson. The Erdős-Ko-Rado theorem for vector spaces. Journal of Combinatorial Theory, Series A, 43(2):228–236, 1986.
- [15] Chris Godsil and Karen Meagher. A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations. European Journal of Combinatorics, 30(2):404–414, 2009.
- [16] Chris Godsil and Gordon F Royle. Algebraic graph theory, volume 207. Springer Science & Business Media, 2001.
- [17] Christopher Godsil and Karen Meagher. Erdős–Ko–Rado Theorems: Algebraic Approaches. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2015.
- [18] Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, and Štefko Miklavič. On maximum intersecting sets in direct and wreath product of groups. European Journal of Combinatorics, 103:103523, 2022.
- [19] I Martin Isaacs. Character theory of finite groups, volume 69. Courier Corporation, 1994.
- [20] Benoit Larose and Claudia Malvenuto. Stable sets of maximal size in Kneser-type graphs. European Journal of Combinatorics, 25(5):657–673, 2004.
- [21] Cai Heng Li, Shu Jiao Song, and Venkata Raghu Tej Pantangi. Erdős-Ko-Rado problems for permutation groups. arXiv preprint arXiv:2006.10339, 2020.
- [22] Ling Long, Rafael Plaza, Peter Sin, and Qing Xiang. Characterization of intersecting families of maximum size in PSL(2, q). Journal of Combinatorial Theory, Series A, 157:461–499, 2018.
- [23] Karen Meagher. An Erdős-Ko-Rado theorem for the group PSU(3, q). Designs, Codes and Cryptography, 87(4):717–744, 2019.
- [24] Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra, and Pablo Spiga. On triangles in derangement graphs. Journal of Combinatorial Theory, Series A, 180:105390, 2021.
- [25] Karen Meagher and Peter Sin. All 2-transitive groups have the EKR-module property. Journal of Combinatorial Theory, Series A, 177:105322, 2021.
- [26] Karen Meagher and Pablo Spiga. An Erdős–Ko–Rado theorem for the derangement graph of PGL(2, q) acting on the projective line. Journal of Combinatorial Theory, Series A, 118(2):532–544, 2011.
- [27] Karen Meagher, Pablo Spiga, and Pham Huu Tiep. An Erdős–Ko–Rado theorem for finite 2-transitive groups. European Journal of Combinatorics, 55:100–118, 2016.
- [28] Cheryl E Praeger. Finite quasiprimitive graphs. University of Western Australia. Department of Mathematics, 1996.