2000 character limit reached
Derangements in non-Frobenius groups
Published 5 Sep 2024 in math.GR | (2409.03305v2)
Abstract: We prove that if $G$ is a transitive permutation group of sufficiently large degree $n$, then either $G$ is primitive and Frobenius, or the proportion of derangements in $G$ is larger than $1/(2n{1/2})$. This is sharp, generalizes substantially bounds of Cameron--Cohen and Guralnick--Wan, and settles conjectures of Guralnick--Tiep and Bailey--Cameron--Giudici--Royle in large degree. We also give an application to coverings of varieties over finite fields.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.