A polynomial bound for the orders of primitive solvable groups

DOI10.1016/0021-8693(82)90281-2zbMath0489.20004OpenAlexW2040864433WikidataQ106072097 ScholiaQ106072097MaRDI QIDQ1166603

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)90281-2

zbMATH Keywords

solvable linear groupsorder boundsprimitive solvable permutation groupstransitive solvable groups of degree \(n\)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Primitive groups (20B15) General theory for finite permutation groups (20B05) Multiply transitive finite groups (20B20)

Related Items (42)

Primitive sharp permutation groups with large solvable subgroups ⋮ Asymptotic results for primitive permutation groups ⋮ The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups ⋮ Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed ⋮ On the orders of primitive linear P'-groups ⋮ Parallel algorithms for solvable permutation groups ⋮ A bound on the rank of primitive solvable permutation groups ⋮ Groups without faithful transitive permutation representations of small degree ⋮ Algorithms in Algebraic Number Theory ⋮ Upper bounds for the number of conjugacy classes of a finite group ⋮ Finite groups, minimal bases and the intersection number ⋮ Isomorphism of graphs of bounded valence can be tested in polynomial time ⋮ Intersections of maximal subgroups in prosolvable groups ⋮ Base sizes for primitive groups with soluble stabilisers ⋮ Polynomial time recognition and testing of isomorphism of cyclic tournaments ⋮ The size of the solvable residual in finite groups. ⋮ On the probability of generating prosoluble groups. ⋮ On the probability of generating free prosoluble groups of small rank. ⋮ Normalizers of primitive permutation groups ⋮ Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments ⋮ Linear groups ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Nilpotent subgroups of finite soluble groups ⋮ Bounds on finite quasiprimitive permutation groups ⋮ Testing isomorphism of circulant objects in polynomial time ⋮ Circulant graphs: recognizing and isomorphism testing in polynomial time ⋮ A survey of homogeneous structures ⋮ Isomorphism and canonization of tournaments and hypertournaments ⋮ Transitive projective planes and insoluble groups ⋮ Finitely generated groups with polynomial index growth ⋮ The minimal base size for a 𝑝-solvable linear group ⋮ Permutation Groups and the Graph Isomorphism Problem ⋮ The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time ⋮ \(\sqrt{2}+\sqrt{3}\): Four different views ⋮ Finite groups with large Noether number are almost cyclic ⋮ Large orbits of supersolvable linear groups ⋮ On a conjecture of Gluck. ⋮ Graph isomorphism problem and \(2\)-closed permutation groups ⋮ Sylow's theorem in polynomial time ⋮ Bounding the orders of nilpotent subgroups of solvable linear groups ⋮ The number of set-orbits of a solvable permutation group ⋮ Solvability by radicals is in polynomial time

Cites Work

• On the orders of primitive groups with restricted nonabelian composition factors
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Finite Permutation Groups and Finite Simple Groups
• The Fitting subgroup of a linear solvable group
• Maximal Abelian Subgroups of the Symmetric Groups
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial bound for the orders of primitive solvable groups