多项式时间有限群的形成:f -残差和f -次正态

IF 0.6 4区数学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Journal of Symbolic Computation Pub Date : 2023-09-25 DOI:10.1016/j.jsc.2023.102271

Viachaslau I. Murashka

引用次数: 0

摘要

对于一个广泛的组F族，证明了置换有限群的F残差可以在多项式时间内计算。此外，如果在前面的情况下F是遗传的，那么可以在多项式时间内检查子群的F-子正规性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Formations of finite groups in polynomial time: F-residuals and F-subnormality

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Symbolic Computation 工程技术-计算机：理论方法

CiteScore

2.10

自引率

14.30%

发文量

审稿时长

142 days

期刊介绍： An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.