English

Erd\H{o}s-Ko-Rado problems for permutation groups

Combinatorics 2021-01-19 v2 Group Theory

Abstract

In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let GSym(Ω)G \leqslant \mathrm{Sym}(\Omega) 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 SGω|{S}|\leqslant|G_{\omega}| (for some ωΩ\omega \in \Omega). Furthermore, for some 2-transitive groups, S=Gω|{S}|=|G_{\omega}| 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 ScGω|{S}|\leqslant c|G_\omega|. 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 GSym(Ω)G \leqslant \mathrm{Sym}(\Omega) is a permutation group of prime power degree, then for any intersecting set SS, we have SGω|S|\leq |G_{\omega}| (for some ωΩ\omega \in \Omega). This proves a part of a conjecture in \cite{MRS}.

Keywords

Cite

@article{arxiv.2006.10339,
  title  = {Erd\H{o}s-Ko-Rado problems for permutation groups},
  author = {Cai Heng Li and Shu Jiao Song and Venkata Raghu Tej Pantangi},
  journal= {arXiv preprint arXiv:2006.10339},
  year   = {2021}
}

Comments

19 pages

R2 v1 2026-06-23T16:25:30.529Z