Formations of Finite Groups in Polynomial Time: the \mathfrakF-Radical

2024/07/17 by Murashka, Viachaslau I.
#20B40 #20D10 #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.2407.12720

Abstract

For a Baer-local (composition) Fitting formation \mathfrakF the polynomial time algorithm for the computation of the \mathfrakF-radical of a permutation group is suggested. In particular it is showed how one can compute the \mathfrakF-radical in case when \mathfrakF 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.

Related

• Formations of Finite Groups in Polynomial Time: the \mathfrakF-Hypercenter
• Formations of Finite Groups in Polynomial Time: \mathfrakF-residuals and \mathfrakF-subnormality
• The soluble radical and orbits of certain maps on finite groups
• Criteria for solvable radical membership via p-elements
• A test for a local formation of finite groups to be a formation of soluble groups with the Shemetkov property