Fast recognition of alternating groups of unknown degree.

DOI10.1016/j.jalgebra.2013.06.005zbMath1293.20004arXiv1306.0767MaRDI QIDQ2438377

Sebastian Jambor, Alice C. Niemeyer, Martin Leuner, Wilhelm Plesken

Publication date: 11 March 2014

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

symmetric groups; alternating groups; Monte Carlo algorithms; probabilistic methods; black-box groups; proportions of elements; constructive recognition

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20-04: Software, source code, etc. for problems pertaining to group theory

20B30: Symmetric groups

20P05: Probabilistic methods in group theory

Related Items

A practical model for computation with matrix groups., Constructing composition factors for a linear group in polynomial time, Presentations on standard generators for classical groups, FINDING INVOLUTIONS WITH SMALL SUPPORT

Uses Software

• GAP

Cites Work

• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• A data structure for a uniform approach to computations with finite groups
• On semiregular permutations of a finite set
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• Permutations with Restricted Cycle Structure and an Algorithmic Application
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item