Implementing some algorithms of Kantor

From MaRDI portal





[For the entire collection see Zbl 0758.00016.] In the context of the investigation of the complexity of group theoretical algorithms (in particular for permutation groups) that has been carried out by G. Luks, W. M. Kantor and others, many methods have been described only in theory. Since such a complexity analysis usually neglects constant factors, it is not always obvious a priori that in the range of practical applicability it will perform better than existing techniques that may have worse complexities, e.g. involving backtrack techniques. It is therefore of merit that the author investigates by practical implementation some algorithms of W. M. Kantor for the determination of Sylow subgroups of soluble permutation groups and for testing whether a permutation group (given as always by generating permutations) is soluble. A key step is a method for finding a normal subgroup of prime index. After reducing the problem by the use of constituent- and block-homomorphisms the theory of primitivity groups is brought in. The author reports that the method for soluble groups improves on previously used general methods [see the preceding review Zbl 0787.20004 of J. Symb. Comput. 12, No. 4/5, 443-457 (1991)] which showed weak points for this class of groups.











This page was built for publication: Implementing some algorithms of Kantor

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