⌘+K

Pulse Explore Clubs Researchers Journals

Home Clubs Explore

July 17, 2024Open Access

Formations of Finite Groups in Polynomial Time: the F-Radical

Viachaslau Igaravich Murashka

View Full Paper

Ask AI

Bookmark

Share

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.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Viachaslau I. Murashka (2024) studied this question.

synapsesocial.com/papers/68e60128b6db643587594b15 https://doi.org/10.48550/arxiv.2407.12720

View Full Paper

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Formations of Finite Groups in Polynomial Time: the $\mathfrak{F}$-Hypercenter2024
2A test for a local formation of finite groups to be a formation of soluble groups with the Shemetkov property2024
3Constructing regular saturated formations of finite soluble groups2024
4The Radical Solution and Computational Complexity2024
5Radical Orbit Geometry of Polynomial Equations: A Classification Framework from Transitivity to FragmentationOriginal Research · 2026