Formations of finite groups in polynomial time: the F-radical and the F-length

MaRDI QIDQ6940110zbMATH OpenFDO

Authors V. I. Murashko

Publication date 19 August 2025

Published in Zhurnal Belorusskogo Gosudarstvennogo Universiteta. Matematika. Informatika (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://journals.bsu.by/index.php/mathematics/article/view/6757

zbMATH Keywords

\(\mathfrak{F}\)-length\(\mathfrak{F}\)-radicalBaer-local formationFitting formationpermutation group computationpolynomial time algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to group theory (20-08) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Special subgroups (Frattini, Fitting, etc.) (20D25) Analysis of algorithms and problem complexity (68Q25)

Review text

The paper develops polynomial-time algorithms to compute the \(\mathfrak{F}\)-radical and the \((\mathfrak{F},\mathfrak{H})\)-length of a finite group \(G\) given by permutations of degree \(n\), where \(\mathfrak{F}\) is a Baer-local Fitting formation and \(\mathfrak{H}\) is another Fitting class. Assuming that the radicals associated with the local values of the Baer function \(f\) defining \(\mathfrak{F}\) are computable in polynomial time, it is shown that \(G_{\mathfrak{F}}\) and \(\ell_{\mathfrak{F},\mathfrak{H}}(G)\) can also be computed in polynomial time in \(n\).\N\NThe method is based on centralizers of chief factors and includes explicit pseudocode for algorithms FRADICAL, EFRADICAL and FLENGTH. The strategy involves computing a chief series of \(G\), checking whether each chief factor belongs to \(\mathfrak{F}\) via the Baer-local definition and intersecting the corresponding generalized centralizers.\N\NIn addition to the \(\mathfrak{F}\)-radical, the paper discusses various formation-theoretic lengths, including the nilpotent length, \(p\)-length, generalized Fitting height and non-\(p\)-soluble length, each of which is shown to be computable in polynomial time for permutation groups.

Cites work

• Composition formations and radicals of finite groups
• Computing projectors, injectors, residuals and radicals of finite soluble groups
• Computing subgroups by exhibition in finite solvable groups
• Finite soluble groups
• Fitting formations of finite soluble groups
• Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality
• scientific article; zbMATH DE number 3889785 (Why is no real title available?)
• scientific article; zbMATH DE number 3989617 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• Nonsoluble and non-\(p\)-soluble length of finite groups.
• On Baer--local formations of finite groups
• On some classes of sublattices of the subgroup lattice
• On some properties of the lattice of totally \(\sigma \)-local formations of finite groups
• On the length of finite factorized groups.
• On the length of subgroup chains in the symmetric group
• On the lengths of mutually permutable products of finite groups
• Structure theory for canonical classes of finite groups.
• Subgroup closed Fitting classes are formations
• The Fitting Length of a Finite Soluble Group and the Number of Conjugacy Classes of its Maximal Metanilpotent Subgroups

This page was built for publication: Formations of finite groups in polynomial time: the \(\mathfrak{F}\)-radical and the \(\mathfrak{F}\)-length

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