On the maximal number of elements pairwise generating the symmetric group of even degree

preprint2022arXivOpen access

Abstract

Let GG be the symmetric 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 both functions σ(G)σ(G) and ω(G)ω(G) are asymptotically equal to 12(nn/2)\frac{1}{2} \binom{n}{n/2} when nn is even. This, together with a result of S. Blackburn, implies that σ(G)/ω(G)σ(G)/ω(G) tends to 11 as n→∞n \to \infty. Moreover, we give a lower bound of (1−o(1))n(1-o(1))n on ω(G)ω(G) which is independent of the classification of finite simple groups. We also calculate, for large enough nn, the clique number of the graph defined as follows: the vertices are the elements of GG and two vertices x,yx,y are connected by an edge if ⟨x,y⟩≥An\langle x,y \rangle \geq A_n.

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.