Estimation Problems and Randomised Group Algorithms

DOI10.1007/978-1-4471-4814-2_2zbMath1282.20001OpenAlexW2227548006MaRDI QIDQ2841965

Alice C. Niemeyer, Seress, Ákos, Cheryl E. Praeger

Publication date: 30 July 2013

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4471-4814-2_2

zbMATH Keywords

finite simple groupsprobabilistic algorithmsmatrix group recognitioninvolution centralizerslinear groups of Lie type over finite fields

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Simple groups: alternating groups and groups of Lie type (20D06) Randomized algorithms (68W20) Probabilistic methods in group theory (20P05) Research exposition (monographs, survey articles) pertaining to group theory (20-02)

Related Items (4)

Permutations with equal orders ⋮ Identifying long cycles in finite alternating and symmetric groups acting on subsets ⋮ Convergence criteria for \(\text{FI}_{\mathcal{W}}\)-algebras and polynomial statistics on maximal tori in type B/C ⋮ Permutations with orders coprime to a given integer

Uses Software

• GAP
• Magma

This page was built for publication: Estimation Problems and Randomised Group Algorithms