scientific article; zbMATH DE number 1004937

MaRDI QIDQ4335300zbMATH OpenFDO

Authors Ákos Seress, Eugene M. Luks

Publication date 6 November 1997

zbMATH Keywords

\(p\)-corescentralizers of normal subgroupsFitting subgroupsMonte Carlo algorithmsnearly linear running timessmall-base permutation groupssolvable radicals

Mathematics Subject Classification ID

Finite nilpotent groups, (p)-groups (20D15) Subgroup theorems; subgroup growth (20E07) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Review text

This paper presents new Monte Carlo (randomized) algorithms for computing the Fitting subgroup (largest nilpotent normal subgroup) and solvable radical (largest solvable normal subgroup) of a permutation group. These include new algorithms for computing \(p\)-cores (largest normal \(p\)-subgroup, for any prime \(p\)) and centralizers of normal subgroups. The running time of the new algorithms is nearly linear (linear except for logarithmic factors) for small-base permutation groups (where the order of the group is polylogarithmic in the size of the permutation domain). The new algorithms, besides being asymptotically faster than previous algorithms for the same problems, have been implemented in the GAP software system. For the entire collection see [Zbl 0861.00012].

Recommendations

• Computing the soluble radical of a permutation group.
• scientific article; zbMATH DE number 1004940
• scientific article; zbMATH DE number 1273663
• scientific article; zbMATH DE number 1254261

Cited in

(4)

• Automorphism group computation and isomorphism testing in finite groups
• Computing conjugacy classes of elements in matrix groups.
• Computing the soluble radical of a permutation group.
• scientific article; zbMATH DE number 1004940 (Why is no real title available?)

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 Q4335300)