No label defined (Q4335300)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1004937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1004937 |
Statements
6 November 1997
0 references
small-base permutation groups
0 references
Monte Carlo algorithms
0 references
nearly linear running times
0 references
Fitting subgroups
0 references
solvable radicals
0 references
\(p\)-cores
0 references
centralizers of normal subgroups
0 references
0.8478755950927734
0 references
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].
0 references
