On the maximal number of elements pairwise generating the finite alternating group
DOI10.1016/J.JCTA.2024.105870arXiv2206.11388OpenAlexW4391830396MaRDI QIDQ6126166FDOQ6126166
Authors: Francesco Fumagalli, Martino Garonzi, Pietro Gheri
Publication date: 9 April 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.11388
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
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Subgroups of symmetric groups (20B35) Arithmetic and combinatorial problems involving abstract finite groups (20D60)
Cites Work
- Title not available (Why is that?)
- Finite primitive permutation groups containing a permutation having at most four cycles
- Affine transformations of finite vector spaces with large orders or few cycles.
- Cyclic regular subgroups of primitive permutation groups
- Covering the symmetric groups with proper subgroups.
- Sets of elements that pairwise generate a linear group
- On the covering number of symmetric groups having degree divisible by six.
- Sets of permutations that generate the symmetric group pairwise.
- On the clique number of the generating graph of a finite group
- On the orders of primitive groups
- A note on vertex list colouring
- On the maximal number of elements pairwise generating the symmetric group of even degree
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)