Fast recognition of doubly transitive groups

DOI10.1016/S0747-7171(08)80098-3zbMath0790.20005OpenAlexW2016335765MaRDI QIDQ1192228

Peter J. Cameron, John J. Cannon

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80098-3

zbMATH Keywords

algorithmsbasestrong generating setcomposition factors of finite groupsfinite doubly transitive permutation group

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Series and lattices of subgroups (20D30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Multiply transitive finite groups (20B20)

Related Items (max. 100)

Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture ⋮ Algorithmic Recognition of Actions of 2-Homogeneous Groups on Pairs

Uses Software

• Cayley

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zweifach transitive, auflösbare Permutationsgruppen
• Finding composition factors of permutation groups of degree \(n\leq 10^ 6\)
• Transitive linear groups and linear groups which contain irreducible subgroups of prime order
• On finite simple groups of characteristic 2 type
• On the degrees of Steinberg characters of Chevalley groups
• Computing in Permutation and Matrix Groups I: Normal Closure, Commutator Subgroups, Series
• A compact representation for permutation groups
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• Finite Permutation Groups and Finite Simple Groups
• The 2-Transitive Permutation Representations of the Finite Chevalley Groups

This page was built for publication: Fast recognition of doubly transitive groups