Formations of Finite Groups in Polynomial Time: \mathfrakF-residuals and \mathfrakF-subnormality

2022/05/25 by Viachaslau I. Murashka, Murashka, Viachaslau I.
Computer Science · Engineering · Mathematics · #20B40 #20D10 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2205.12913

openalex publication_date 2022/05/25 · openalex created_date 2022/06/13 · openalex updated_date 2026/07/28

Abstract

For a wide family of formations \mathfrakF it is proved that the \mathfrakF-residual of a permutation finite group can be computed in a polynomial time. Moreover, if in the previous case \mathfrakF is hereditary, then an \mathfrakF-subnormality of a subgroup can be checked in a polynomial time.

Related

• Formations of Finite Groups in Polynomial Time: the \mathfrakF-Hypercenter
• Formations of Finite Groups in Polynomial Time: the \mathfrakF-Radical
• Constructing uncountably many groups with the same profinite completion
• Arbitrarily Large Residual Finiteness Growth
• Non-linear residually finite groups