Answers are grounded in this paper and cite their sources.
We prove that for n≥2, the length of every subgroup chain in Sn is at most 2n-3. The proof rests on an upper bound for the order of primitive permutation groups, due to Praeger and Saxl. The result has applications to worst case complexity estimates for permutation group algorithms.
No takes yet. Share an insight, caveat, or question.
László Babai (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: