The product replacement prospector.

DOI10.1016/J.JSC.2011.08.017zbMATH Open1245.20001OpenAlexW2081165772MaRDI QIDQ654033FDOQ654033

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

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

Recommendations

• What do we know about the product replacement algorithm?
• Product Replacement in the Monster
• Publication:4952678
• Generating random elements of a finite group
• The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups

zbMATH Keywords

random elementsproduct replacement algorithmblack-box groupscomputational group theory

Mathematics Subject Classification ID

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

Cites Work

• The Magma algebra system. I: The user language
• The Distribution of Chi-Square
• Title not available (Why is that?)
• Title not available (Why is that?)
• Karl Pearson and the Chi-Squared Test
• Comparison techniques for random walk on finite groups
• Generating random elements of a finite group
• What do we know about the product replacement algorithm?
• Moderate growth and random walk on finite groups
• Title not available (Why is that?)
• The computational matrix group project.
• Title not available (Why is that?)
• Constructive recognition of classical groups in odd characteristic.
• Generating random elements in finite groups.
• Strong bias of group generators: an obstacle to the “product replacement algorithm”

Cited In (10)

• What do we know about the product replacement algorithm?
• Nielsen equivalence in Fuchsian groups
• Product Replacement in the Monster
• Generating random elements of a finite group
• Title not available (Why is that?)
• Interactions of computational complexity theory and mathematics
• Strong bias of group generators: an obstacle to the “product replacement algorithm”
• An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups
• Showcasing straight-line programs with memory via matrix Bruhat decomposition
• On a variant of the product replacement algorithm

Uses Software

• GAP
• Magma
• ATLAS Group Representations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654033)