Intersecting subsets in finite permutation groups
Abstract
Let G≤slantSym() be transitive, and let S be an intersecting subset, namely, the ratio xy-1 of any elements x,y∈ S fixes some point. An EKR-type problem is to characterize transitive groups G≤slantSym() such that any intersecting set is upper bounded by |Gω|, where ω∈. A nice result of Meagher-Spiga-Tiep (2016) tells us that if G is 2-transitive, then indeed |S|≤slant|Gω|. A natural next step would be to explore intersecting subsets for primitive groups and quasiprimitive groups. Our study in this paper shows that for quasiprimitive permutation groups, the size |S| can be arbitrarily larger than |Gω|. We conjecture that for quasiprimitve groups, the upperbound for |S| is O(|Gω|||12). As a starting point, we prove that |S|/(|Gω|||12)≤slant2/2 for all quasiprimitive actions of the Suzuki groups G=Sz(q). To show that our conjectured upper bound is tight, we provide examples of groups for which |S|/(|Gω|||12) is arbitrarily close to 2/2. As far as general transitive groups concerned, infinity families of examples produced show that the ratio |S|/(|Gω|||12) can be arbitrarily large.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.