English

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

Group Theory 2022-06-24 v1 Combinatorics

Abstract

Let GG be the alternating group of degree nn. Let ω(G)\omega(G) be the maximal size of a subset SS of GG such that x,y=G\langle x,y \rangle = G whenever x,ySx,y \in S and xyx \neq y and let σ(G)\sigma(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)\sigma(G)/\omega(G) tends to 11 as nn \to \infty. Moreover, we explicitly calculate σ(An)\sigma(A_n) for n21n \geq 21 congruent to 33 modulo 1818.

Keywords

Cite

@article{arxiv.2206.11388,
  title  = {On the maximal number of elements pairwise generating the finite alternating group},
  author = {Francesco Fumagalli and Martino Garonzi and Pietro Gheri},
  journal= {arXiv preprint arXiv:2206.11388},
  year   = {2022}
}