SearcharxivSearch

arXiv · 2403.17783

Intersecting subsets in finite permutation groups

Abstract

Let $G\leqslant\mathrm{Sym}(\Omega)$ be transitive, and let $S$ be an intersecting subset, namely, the ratio $xy^{-1}$ of any elements $x,y\in S$ fixes some point. An EKR-type problem is to characterize transitive groups $G\leqslant\mathrm{Sym}(\Omega)$ such that any intersecting set is upper bounded by $|G_\omega|$, where $\omega\in\Omega$. A nice result of Meagher-Spiga-Tiep (2016) tells us that if $G$ is 2-transitive, then indeed $|S|\leqslant|G_\omega|$. 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_\omega|$. We conjecture that for quasiprimitve groups, the upperbound for $|S|$ is $O(|G_\omega||\Omega|^{1\over2})$. As a starting point, we prove that ${|S|/(|G_\omega||\Omega|^{1\over2}})\leqslant{\sqrt2/2}$ for all quasiprimitive actions of the Suzuki groups $G=\mathrm{Sz}(q)$. To show that our conjectured upper bound is tight, we provide examples of groups for which ${|S|/(|G_\omega||\Omega|^{1\over2}})$ is arbitrarily close to ${\sqrt2/2}$. As far as general transitive groups concerned, infinity families of examples produced show that the ratio ${|S|/(|G_\omega||\Omega|^{1\over2}})$ can be arbitrarily large.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

CaiHeng Li, Venkata Raghu Tej Pantangi, Shujiao Song, Yilin Xie. 2024-03-26. Intersecting subsets in finite permutation groups. https://arxiv.org/abs/2403.17783

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR