Abstract:A subset S of the alternating group on n points is intersecting if for any pair of permutations π, σ in S, there is an element i ∈ {1, . . . , n} such that π(i) = σ(i). We prove that if S is intersecting, then |S| ≤ (n−1)! 2 . Also, we prove that if n ≥ 5, then the only sets S that meet this bound are the cosets of the stabilizer of a point of {1, . . . , n}.
“…Namely, we prove that the characteristic vector for any maximum intersecting set in PSU(3, q) is a linear combination of characteristic vectors of the canonical cliques in PSU (3, q). Showing the same result for other 2-transitive groups was a key result in proving that the groups have the strict-EKR property [1,10,15,16].…”
Section: Introductionmentioning
confidence: 73%
“…Although all 2-transitive groups have the ERK-property, it is not true that all 2-transitive groups have the strict-EKR property. It has been shown that Sym(n), Alt(n), PGL(2, q), PGL(3, q), PSL(2, q) [14] and the Mathieu groups all have the strict-EKR property by first showing that they have the EKR-module property [1,2,10,15,16,14]. It is shown in [17] that the Suzuki groups, Ree Groups, Higman-Sims, Symplectic groups also have the EKR-module property.…”
Section: Further Workmentioning
confidence: 99%
“…The result in each of [5,10,13] is that the symmetric group has the strict-EKR property. It has also been shown that many other groups also have the strict-EKR property [1,3,12,15,16]. It was recently shown that every 2-transitive group has the EKR property [17].…”
In this paper we consider the derangement graph for the group PSU(3, q) where q is a prime power. We calculate all eigenvalues for this derangement graph and use these eigenvalues to prove that PSU(3, q) has the Erdős-Ko-Rado property and, provided that q = 2, 5, another property that we call the Erdős-Ko-Rado module property.2010 Mathematics Subject Classification. Primary 05C35; Secondary 05C69, 20B05.
“…Namely, we prove that the characteristic vector for any maximum intersecting set in PSU(3, q) is a linear combination of characteristic vectors of the canonical cliques in PSU (3, q). Showing the same result for other 2-transitive groups was a key result in proving that the groups have the strict-EKR property [1,10,15,16].…”
Section: Introductionmentioning
confidence: 73%
“…Although all 2-transitive groups have the ERK-property, it is not true that all 2-transitive groups have the strict-EKR property. It has been shown that Sym(n), Alt(n), PGL(2, q), PGL(3, q), PSL(2, q) [14] and the Mathieu groups all have the strict-EKR property by first showing that they have the EKR-module property [1,2,10,15,16,14]. It is shown in [17] that the Suzuki groups, Ree Groups, Higman-Sims, Symplectic groups also have the EKR-module property.…”
Section: Further Workmentioning
confidence: 99%
“…The result in each of [5,10,13] is that the symmetric group has the strict-EKR property. It has also been shown that many other groups also have the strict-EKR property [1,3,12,15,16]. It was recently shown that every 2-transitive group has the EKR property [17].…”
In this paper we consider the derangement graph for the group PSU(3, q) where q is a prime power. We calculate all eigenvalues for this derangement graph and use these eigenvalues to prove that PSU(3, q) has the Erdős-Ko-Rado property and, provided that q = 2, 5, another property that we call the Erdős-Ko-Rado module property.2010 Mathematics Subject Classification. Primary 05C35; Secondary 05C69, 20B05.
“…Recently there have been many papers proving that the natural extension of the Erdős-Ko-Rado theorem holds for specific permutation groups G (see [1,13,26,28,29,33]) and there are also two papers, [2] and [3], that consider when the natural extension of the Erdős-Ko-Rado theorem holds for transitive and 2transitive groups. Again, this means asking if the largest intersecting sets in G are the cosets in G of the stabiliser of a point.…”
We prove an analogue of the classical Erdős-Ko-Rado theorem for intersecting sets of permutations in finite 2-transitive groups. Given a finite group G acting faithfully and 2-transitively on the set Ω, we show that an intersecting set of maximal size in G has cardinality |G|/|Ω|. This generalises and gives a unifying proof of some similar recent results in the literature.2010 Mathematics Subject Classification. Primary 05C35; Secondary 05C69, 20B05.
“…There have been several recent publications [2,6,12,15,16,17,19] that determine the maximum sets of elements from a permutation group such that any two permutations from the set both map at least one point to the same element. These results are considered to be versions of the Erdős-Ko-Rado (EKR) theorem [9] for permutations.…”
A subset S of a group G ≤ Sym(n) is intersecting if for any pair of permutations π, σ ∈ S there is an i ∈ {1, 2, . . . , n} such that π(i) = σ (i). It has been shown, using an algebraic approach, that the largest intersecting sets in each of Sym(n), Alt(n), and PGL(2, q) are exactly the cosets of the point-stabilizers. In this paper, we show how this approach can be applied more generally to many 2-transitive groups. We then apply this method to the Mathieu groups and to all 2-transitive groups with degree no more than 20.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.