Formations of Finite Groups in Polynomial Time: the F-Radical
Abstract
For a Baer-local (composition) Fitting formation F the polynomial time algorithm for the computation of the F-radical of a permutation group is suggested. In particular it is showed how one can compute the F-radical in case when F is a primitive saturated formation of soluble groups. Moreover, the polynomial time algorithms for the computation of different lengthes associated with a group are presented.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.