On the maximal number of elements pairwise generating the finite alternating group

preprint2022arXivOpen access

Abstract

Let GG be the alternating group of degree nn. Let ω(G)ω(G) be the maximal size of a subset SS of GG such that ⟨x,y⟩=G\langle x,y \rangle = G whenever x,y∈Sx,y \in S and x≠yx \neq y and let σ(G)σ(G) be the minimal size of a family of proper subgroups of GG whose union is GG. We prove that, when nn varies in the family of composite numbers, σ(G)/ω(G)σ(G)/ω(G) tends to 11 as n→∞n \to \infty. Moreover, we explicitly calculate σ(An)σ(A_n) for n≥21n \geq 21 congruent to 33 modulo 1818.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.