The product replacement prospector.

DOI10.1016/J.JSC.2011.08.017zbMath1245.20001OpenAlexW2081165772MaRDI QIDQ654033

Henrik Bäärnhielm, Charles R. Leedham-Green

Publication date: 21 December 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.08.017

zbMATH Keywords

random elementsproduct replacement algorithmblack-box groupscomputational group theory

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to group theory (20-04) Probabilistic methods in group theory (20P05)

Related Items (5)

An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups ⋮ Nielsen equivalence in Fuchsian groups ⋮ On a variant of the product replacement algorithm ⋮ Interactions of computational complexity theory and mathematics ⋮ Showcasing straight-line programs with memory via matrix Bruhat decomposition

Uses Software

• ATLAS Group Representations
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive recognition of classical groups in odd characteristic.
• Generating random elements in finite groups.
• Comparison techniques for random walk on finite groups
• Moderate growth and random walk on finite groups
• The Magma algebra system. I: The user language
• Karl Pearson and the Chi-Squared Test
• The Distribution of Chi-Square
• Strong bias of group generators: an obstacle to the “product replacement algorithm”
• Generating random elements of a finite group

This page was built for publication: The product replacement prospector.