2025/05/09 by Daniele Dona, Dona, Daniele
Mathematics · #20B30 #20E45 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Geometric and Algebraic Topology #Group Theory (math.GR) #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2505.06012
openalex publication_date 2025/05/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We prove that for δ small, n large, and any three conjugacy classes C1,C2,C3 of G=Alt(n) of size at least |G|1-δ we have C1C2C3=G. The result provides a positive answer to Problem 20.23 of the Kourovka Notebook [KM22], improves theorems of Garonzi and Maróti [GM21] (using 4 classes) and Rodgers [Rod02] (using larger classes), complements the known result for G a simple group of Lie type [MP21] [LST24] [FM25], and is tight in several senses. Furthermore, since no character theory is involved, the proof can be used in principle to build a constructive algorithm that, given g∈ G, outputs ci∈ Ci such that c1c2c3=g.