Fast detection of giant permutation groups

2019/05/23 by Unger, William R.
#FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1905.09431

Abstract

We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.

Related

• Minimal sized generating sets of permutation groups
• Automatic discovery of structural rules of permutation classes
• Towards a practical, theoretically sound algorithm for random generation in finite groups
• Faster and simpler algorithms for finding large patterns in permutations
• Algorithms for discovering and proving theorems about permutation\n patterns