On the maximal number of elements pairwise generating the finite alternating group
Abstract
Let G be the alternating group of degree n. Let ω(G) be the maximal size of a subset S of G such that x,y = G whenever x,y ∈ S and x ≠ y and let σ(G) be the minimal size of a family of proper subgroups of G whose union is G. We prove that, when n varies in the family of composite numbers, σ(G)/ω(G) tends to 1 as n ∞. Moreover, we explicitly calculate σ(An) for n ≥ 21 congruent to 3 modulo 18.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.