A black-box group algorithm for recognizing finite symmetric and alternating groups, I

DOI10.1090/S0002-9947-03-03040-XzbMath1022.20004MaRDI QIDQ4794618

Seress, Ákos, Cheryl E. Praeger, Alice C. Niemeyer, Robert Beals, Charles R. Leedham-Green

Publication date: 19 February 2003

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

symmetric groups; alternating groups; recognition; permutation representations; black-box groups; Las Vegas algorithms; group theoretic algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

20B30: Symmetric groups

20P05: Probabilistic methods in group theory

Related Items

A black-box group algorithm for recognizing finite symmetric and alternating groups, I, Fast Constructive Recognition of Black-Box Unitary Groups, RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS, Constructing Maximal Subgroups of Classical Groups, Large element orders and the characteristic of Lie-type simple groups., Constructive recognition of classical groups in odd characteristic., Prime power graphs for groups of Lie type, Fast recognition of alternating groups of unknown degree., On permutations of order dividing a given integer, On the frequency of permutations containing a long cycle., Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules., Black box exceptional groups of Lie type, Short presentations for alternating and symmetric groups, Generalised Sifting in Black-Box Groups, Constructive membership in black-box groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Black box exceptional groups of Lie type. II.
• Über die Anzahl der Lösungen von \(x^n=1\) in der symmetrischen Gruppe \(S_n\)
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• On some problems of a statistical group theory. VII
• Black box classical groups
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• Generating random elements of a finite group