On minimal coverings and pairwise generation of some primitive groups of wreath product type
On minimal coverings and pairwise generation of some primitive groups of wreath product type (scientific article; zbMATH DE number 7916063)
The covering number \(\sigma(G)\) of a non-cyclic finite group \(G\) is the smallest positive integer \(k\) such that \(G\) is a union of \(k\) proper subgroups. Let \(G\) be a finite group that can be generated by \(2\) elements. The generating graph of \(G\) is the simple graph whose vertices are the elements of \(G\) and two vertices are connected by an edge if they generate \(G\). The clique number of the generating graph of \(G\) is denoted by \(\omega(G)\). It is easy to see that \(\omega(G) \leq \sigma(G)\). There are many papers discussing these two invariants.\N\NLet \(A_n\) and \(S_n\) be the alternating and symmetric groups of degree \(n \geq 5\) acting on \(\{ 1, \ldots , n \}\). Let \(\tau\) be the transposition \((1,2)\). Let \(m\) be a positive integer. Let \(\delta\) be the permutation \((1, \ldots, m)\) and let \(\gamma\) be \((1, \ldots, 1, \tau) \delta \in S_{n} \wr S_{m}\). For elements \(x_{1}, \ldots , x_{m} \in A_n\), we have\N\[\N(x_{1}, \ldots , x_{m})^{\gamma} = (x_{m}^{\tau}, x_{1}, \ldots , x_{m-1}) \in {(A_{n})}^{m}.\N\]\NFinally, let \(G = G_{n,m}\) be the semidirect product \({(A_{n})}^{m} : \langle \gamma \rangle\).\N\NFor a positive integer \(x\), let \(\alpha(x)\) be the number of distinct prime factors of \(x\). The first main theorem of the paper is the following:\N\NTheorem 1. Let \(G = G_{n,m}\) for \(n \geq 30\) divisible by \(6\) and \(m \geq 2\). Then \N\[\N\sigma(G) = \alpha(2m) + {\Big( \frac{1}{2} \binom{n}{n/2} \Big)}^{m} + \sum_{i=1}^{(n/3)-1} \binom{n}{i}^{m}.\N\]\NMoreover, \(G\) has a unique minimal covering consisiting of maximal subgroups.\N\NFor \(m=1\) we have \(G_{n,1} = S_n\) and thus Theorem 1 generalizes the main result of \textit{E. Swartz} [Discrete Math. 339, No. 11, 2593--2604 (2016; Zbl 1344.20036)].\N\NThe second main theorem of the paper is asymptotic.\N\NTheorem 2. Let \(G = G_{n,m}\) with \(n\) even and \(m \geq 2\). As \(n\) goes to infinity, \(\omega(G)\) is asymptotically equal to \({( \frac{1}{2} \binom{n}{n/2} )}^{m}\) and \(\omega(G)/\sigma(G)\) tends to \(1\).
- Covering certain wreath products with proper subgroups
- Normal coverings and pairwise generation of finite alternating and symmetric groups.
- On the maximal number of elements pairwise generating the symmetric group of even degree
- GENERATING AND COVERING THE ALTERNATING OR SYMMETRIC GROUP
- On the covering number of small symmetric groups and some sporadic simple groups.
- A classification of the maximal subgroups of the finite alternating and symmetric groups
- Classes of Finite Groups
- Covering certain monolithic groups with proper subgroups.
- Covering certain wreath products with proper subgroups
- Covering the symmetric groups with proper subgroups.
- Generators for finite groups with a unique minimal normal subgroup
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- On $n$-Sum Groups.
- On the clique number of the generating graph of a finite group
- On the covering number of \(S_{14}\)
- On the covering number of small symmetric groups and some sporadic simple groups.
- On the covering number of symmetric groups having degree divisible by six.
- On the maximal number of elements pairwise generating the symmetric group of even degree
- On the orders of primitive groups
- On the orders of Primitive Permutation Groups
- Sets of permutations that generate the symmetric group pairwise.
- The probabilistic method
- The symmetric group of degree six can be covered by 13 and no fewer proper subgroups.
This page was built for publication: On minimal coverings and pairwise generation of some primitive groups of wreath product type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608217)
