This paper studies a parameter estimating largest disjoint subsets in transitive groups, indicating bounds and behaviors.
Let G be a transitive permutation group. In this paper, we introduce and study the parameter (G), which estimates the size of the largest set of points A such that there exists a permutation g with the property that A ∩ Aᵍ is empty. In particular, we focus on deriving general bounds for arbitrary transitive groups, and on the asymptotic behaviour of certain families of primitive groups.
No takes yet. Share an insight, caveat, or question.
Barbieri et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: