scientific article; zbMATH DE number 3989617

zbMATH Open0612.20001MaRDI QIDQ3752563FDOQ3752563

Peter M. Neumann

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1263311
• scientific article; zbMATH DE number 1849958
• Fast Management of Permutation Groups I
• scientific article; zbMATH DE number 475352
• scientific article

zbMATH Keywords

algorithmssimplicitygeneratorsprimitive permutation groupsrecursioncomposition factorsminimal normal subgroupscomputational group theoryO'Nan-Scott theoremfaithful permutation representationCayley system

Mathematics Subject Classification ID

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

Cited In (43)

• Title not available (Why is that?)
• An improvement to the centralizer algorithm for permutation groups
• Algorithms for permutability in finite groups.
• Title not available (Why is that?)
• SUBGROUPS WITH NO ABELIAN COMPOSITION FACTORS ARE NOT DISTINGUISHED
• On exceptional groups of order \(p^5\)
• The primitive soluble permutation groups of degree less than 256
• Title not available (Why is that?)
• Effective computation with group homomorphisms
• Title not available (Why is that?)
• Computing in permutation and matrix groups. III: Sylow subgroups
• Title not available (Why is that?)
• THE CONTRIBUTION OF L. G. KOVÁCS TO THE THEORY OF PERMUTATION GROUPS
• Computing the composition factors of a permutation group in polynomial time
• A New Base Change Algorithm for Permutation Groups
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Fundamental algorithms for permutation groups
• Vertex-minimal graphs with dihedral symmetry. I.
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
• Title not available (Why is that?)
• An algorithm for solving the factorization problem in permutation groups
• Fast Management of Permutation Groups I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the soluble radical of a permutation group.
• Minimal permutation representations of semidirect products of groups.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Normalizers of \(p\)-subgroups in finite groups.
• THE GRADED CENTER OF A TRIANGULATED CATEGORY
• Computing the order of a solvable permutation group
• Constructing transitive permutation groups.
• Title not available (Why is that?)
• Fast recognition of doubly transitive groups
• Finding composition factors of permutation groups of degree \(n\leq 10^ 6\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A fast isomorphism test for groups whose Lie algebra has genus 2
• Title not available (Why is that?)
• Representing the quotient groups of a finite permutation group
• Computing the subgroups of a permutation group

This page was built for publication:

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