A random base change algorithm for permutation groups

DOI10.1006/jsco.1994.1032zbMath0835.20007OpenAlexW2088432915MaRDI QIDQ1338740

Gene Cooperman, Larry Finkelstein

Publication date: 25 March 1996

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

Full work available at URL: https://doi.org/10.1006/jsco.1994.1032

zbMATH Keywords

permutation groupsrandom elementsrandom generatorsgroup membershipasymptotic running timespoint stabilizer sequencesrandom base change algorithms

Mathematics Subject Classification ID

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

Related Items (1)

Fast computation of the centralizer of a permutation group in the symmetric group

Uses Software

• GAP
• Cayley

This page was built for publication: A random base change algorithm for permutation groups