Generalised Sifting in Black-Box Groups

DOI10.1112/S1461157000000978zbMath1112.20001arXivmath/0501346MaRDI QIDQ3430812

Max Neunhöffer, Sophie Ambrose, Cheryl E. Praeger, Csaba Schneider

Publication date: 4 April 2007

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0501346

zbMATH Keywords

sporadic simple groupsMonte Carlo algorithmsGAPblack-box groupscomputational procedures for groupssubset chains

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Simple groups: sporadic groups (20D08) Software, source code, etc. for problems pertaining to group theory (20-04) Randomized algorithms (68W20)

Uses Software

• GAP
• Magma

Cites Work

• The Magma algebra system. I: The user language
• Standard generators for sporadic simple groups
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• Permutations with Restricted Cycle Structure and an Algorithmic Application

This page was built for publication: Generalised Sifting in Black-Box Groups