Answers are grounded in this paper and cite their sources.
We study the obstacles for a family of finite groups to having faithful permutation representations of arbitrarily small degrees compared to their respective orders. We show that the only obstacle is that each group has a cyclic subgroup of prime-power order and bounded index. Specifically, we show the following: Let μ(G) be the smallest degree of a faithful permutation representation of G, and let i(G) be the index of its largest cyclic subgroup of prime-power order. Then for a constant c > 0
No takes yet. Share an insight, caveat, or question.
Babai et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: