On the maximal number of elements pairwise generating the finite alternating group
From MaRDI portal
Publication:6126166
Abstract: Let be the alternating group of degree . Let be the maximal size of a subset of such that whenever and and let be the minimal size of a family of proper subgroups of whose union is . We prove that, when varies in the family of composite numbers, tends to as . Moreover, we explicitly calculate for congruent to modulo .
Recommendations
- On the maximal number of elements pairwise generating the symmetric group of even degree
- scientific article; zbMATH DE number 4061474
- Normal coverings and pairwise generation of finite alternating and symmetric groups.
- Sets of permutations that generate the symmetric group pairwise.
- Generation of alternating groups by pairs of conjugates
Cites work
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- A note on vertex list colouring
- Affine transformations of finite vector spaces with large orders or few cycles.
- Covering the symmetric groups with proper subgroups.
- Cyclic regular subgroups of primitive permutation groups
- Finite primitive permutation groups containing a permutation having at most four cycles
- On the clique number of the generating graph of a finite group
- 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
- Sets of elements that pairwise generate a linear group
- Sets of permutations that generate the symmetric group pairwise.
This page was built for publication: On the maximal number of elements pairwise generating the finite alternating group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126166)