On the orders of primitive groups with restricted nonabelian composition factors

DOI10.1016/0021-8693(82)90323-4zbMath0493.20001OpenAlexW2081256177MaRDI QIDQ1168415

Peter J. Cameron, László Babai, Péter P. Pálfy

Publication date: 1982

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(82)90323-4

zbMATH Keywords

algorithmprimitive permutation groupsfinite simple groupspolynomial timegraph isomorphismnonabelian composition factororder of permutation groupprimitive solvable group

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Primitive groups (20B15) General theory for finite permutation groups (20B05)

Related Items

Isomorphism Testing for Graphs Excluding Small Minors, Subgroup growth and congruence subgroups, Asymptotic results for primitive permutation groups, A proof of Pyber's base size conjecture, Permutation groups with restricted stabilizers, Positively finitely related profinite groups, Parallel algorithms for solvable permutation groups, Words, Hausdorff dimension and randomly free groups, Variations on polynomial subgroup growth, Groups with super-exponential subgroup growth, Bases for primitive permutation groups and a conjecture of Babai, On the Burness-Giudici conjecture, Counting lattices in simple Lie groups: the positive characteristic case, A Faster Isomorphism Test for Graphs of Small Degree, On the automorphism groups of rank-4 primitive coherent configurations, Isomorphism Testing Parameterized by Genus and Beyond, On computing the closures of solvable permutation groups, Generation and random generation: from simple groups to maximal subgroups., Random generation of finite and profinite groups and group enumeration., On normal subgroups of compact groups, A polynomial bound for the orders of primitive solvable groups, On the automorphism groups of strongly regular graphs. II., Simple groups, maximal subgroups, and probabilistic aspects of profinite groups, On the diameter of permutation groups, Some properties of polynomial subgroup growth groups, Generators and commutators in finite groups; abstract quotients of compact groups., Bounds on finite quasiprimitive permutation groups, Isomorphism and canonization of tournaments and hypertournaments, Stable Finitely Homogeneous Structures, Maximal subgroups in finite and profinite groups, Permutation Groups and the Graph Isomorphism Problem, Graphs with automorphism groups admitting composition factors of bounded rank, Finite simple groups and finite primitive permutation groups, On the orders of primitive groups, Permutation groups without exponentially many orbits on the power set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the order of doubly transitive permutation groups
• On the order of uniprimitive permutation groups
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• On the orders of Primitive Permutation Groups
• Finite Permutation Groups and Finite Simple Groups
• Character Degrees and Derived Length of a Solvable Group
• Maximal Abelian Subgroups of the Symmetric Groups
• Endliche Gruppen I