Estimation problems and randomised group algorithms.

DOI10.1007/978-1-4471-4814-2_2MaRDI QIDQ2841965zbMATH OpenOpenAlexFDO

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

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 groupsinvolution centralizerslinear groups of Lie type over finite fieldsmatrix group recognitionprobabilistic algorithms

Mathematics Subject Classification ID

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

Cited in

(11)

• Simple groups in computational group theory
• Prime power graphs for groups of Lie type
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Permutations with orders coprime to a given integer
• Fast recognition of alternating groups of unknown degree.
• Recognising the Suzuki groups in their natural representations.
• Identifying long cycles in finite alternating and symmetric groups acting on subsets
• scientific article; zbMATH DE number 5976624 (Why is no real title available?)
• Convergence criteria for \(\text{FI}_{\mathcal{W}}\)-algebras and polynomial statistics on maximal tori in type B/C
• Permutations with equal orders
• On the proportion of elements of order 2p in finite symmetric groups

Describes a project that uses

Uses Software

• GAP
• Magma

This page was built for publication: Estimation problems and randomised group algorithms.

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