scientific article

zbMath0612.20001MaRDI QIDQ3752563

Peter M. Neumann

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsgeneratorsprimitive permutation groupsrecursioncomposition factorssimplicityminimal normal subgroupscomputational group theoryO'Nan-Scott theoremfaithful permutation representationCayley system

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Extensions, wreath products, and other compositions of groups (20E22) Finite simple groups and their classification (20D05) Software, source code, etc. for problems pertaining to group theory (20-04) Primitive groups (20B15) General theory for finite permutation groups (20B05) Characterization theorems for permutation groups (20B10)

Related Items (12)

On exceptional groups of order \(p^5\) ⋮ Minimal permutation representations of semidirect products of groups. ⋮ SUBGROUPS WITH NO ABELIAN COMPOSITION FACTORS ARE NOT DISTINGUISHED ⋮ THE CONTRIBUTION OF L. G. KOVÁCS TO THE THEORY OF PERMUTATION GROUPS ⋮ THE GRADED CENTER OF A TRIANGULATED CATEGORY ⋮ Constructing transitive permutation groups. ⋮ A fast isomorphism test for groups whose Lie algebra has genus 2 ⋮ Fast recognition of doubly transitive groups ⋮ Finding composition factors of permutation groups of degree \(n\leq 10^ 6\) ⋮ Vertex-minimal graphs with dihedral symmetry. I. ⋮ Computing the soluble radical of a permutation group. ⋮ Representing the quotient groups of a finite permutation group

This page was built for publication: