Computing the composition factors of a permutation group in polynomial time

DOI10.1007/BF02579204MaRDI QIDQ581532zbMATH OpenFDO

Authors Eugene M. Luks

Publication date 1987

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

generatorspermutation groupprimitive permutation groupscomplexity analysiscomposition factorspolynomial time algorithms

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Primitive groups (20B15) Subgroups of symmetric groups (20B35) Series and lattices of subgroups (20D30) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• scientific article; zbMATH DE number 1263311
• scientific article; zbMATH DE number 96388
• scientific article; zbMATH DE number 475352
• Polynomial-time versions of Sylow's theorem
• scientific article; zbMATH DE number 3989617

Cites work

• scientific article; zbMATH DE number 3722702 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3341276 (Why is no real title available?)
• An Algorithm for Finding the Blocks of a Permutation Group
• Finite Permutation Groups and Finite Simple Groups
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Polynomial-time algorithms for finding elements of prime order and sylow subgroups
• Polynomial-time versions of Sylow's theorem
• Solvability of groups of odd order
• Sylow's theorem in polynomial time

Cited in

(16)

• Isomorphism testing of groups of cube-free order
• scientific article; zbMATH DE number 475352 (Why is no real title available?)
• Subcomplete generalizations of graph isomorphism
• Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality
• Conjugacy classes in finite permutation groups via homomorphic images
• scientific article; zbMATH DE number 1263311 (Why is no real title available?)
• Finding composition factors of permutation groups of degree \(n\leq 10^ 6\)
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
• scientific article; zbMATH DE number 2151233 (Why is no real title available?)
• Parallel algorithms for solvable permutation groups
• Constructing composition factors for a linear group in polynomial time
• Algorithms for matrix groups and the Tits alternative
• scientific article; zbMATH DE number 475362 (Why is no real title available?)
• On the nilpotent Lie algebras of dimension \(\leq 7)\)
• On the degree of transitivity of permutation groups: A short proof

This page was built for publication: Computing the composition factors of a permutation group in polynomial time

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