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

DOI10.1016/j.jcta.2024.105870arXiv2206.11388OpenAlexW4391830396MaRDI QIDQ6126166

Pietro Gheri, Martino Garonzi, Francesco Fumagalli

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

zbMATH Keywords

coveringalternating groupgroup generation

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Subgroups of symmetric groups (20B35)

Cites Work

• Unnamed Item
• Finite primitive permutation groups containing a permutation having at most four cycles
• Affine transformations of finite vector spaces with large orders or few cycles.
• Sets of permutations that generate the symmetric group pairwise.
• Covering the symmetric groups with proper subgroups.
• On the orders of primitive groups
• On the maximal number of elements pairwise generating the symmetric group of even degree
• Sets of elements that pairwise generate a linear group
• On the covering number of symmetric groups having degree divisible by six.
• A Note on Vertex List Colouring
• On the clique number of the generating graph of a finite group
• Cyclic regular subgroups of primitive permutation groups

This page was built for publication: On the maximal number of elements pairwise generating the finite alternating group