Abstract

In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let G⩽Sym(Ω)G \leqslant \mathrm{Sym}(Ω) be a transitive permutation group, and S{S} an intersecting set. Previous results show that if GG is either 2-transitive or a Frobenius group, then ∣S∣⩽∣Gω∣|{S}|\leqslant|G_ω| (for some ω∈Ωω\in Ω). Furthermore, for some 2-transitive groups, ∣S∣=∣Gω∣|{S}|=|G_ω| if and only if S{S} is a coset of a stabilizer. In this paper, we prove that these statements are far from the truth for general transitive groups. In particular, we show that in the case of primitive groups, there is even no absolute constant cc such that ∣S∣⩽c∣Gω∣|{S}|\leqslant c|G_ω|. In the case GG is a primitive permutation group isomorphic to PSL(2,p)\mathrm{PSL(2,p)}, we characterize the subgroups of GG which are intersecting sets. We also show that if G⩽Sym(Ω)G \leqslant \mathrm{Sym}(Ω) is a permutation group of prime power degree, then for any intersecting set SS, we have ∣S∣≤∣Gω∣|S|\leq |G_ω| (for some ω∈Ωω\in Ω). This proves a part of a conjecture in \cite{MRS}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.