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

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
{"title":"Formations of finite groups in polynomial time: F-residuals and F-subnormality","authors":"Viachaslau I. Murashka","doi":"10.1016/j.jsc.2023.102271","DOIUrl":null,"url":null,"abstract":"<div><p>For a wide family of formations <span><math><mi>F</mi></math></span> it is proved that the <span><math><mi>F</mi></math></span><span>-residual of a permutation<span> finite group can be computed in polynomial time. Moreover, if in the previous case </span></span><span><math><mi>F</mi></math></span> is hereditary, then the <span><math><mi>F</mi></math></span>-subnormality of a subgroup can be checked in polynomial time.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"122 ","pages":"Article 102271"},"PeriodicalIF":0.6000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717123000858","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多项式时间有限群的形成:f -残差和f -次正态
对于一个广泛的组F族,证明了置换有限群的F残差可以在多项式时间内计算。此外,如果在前面的情况下F是遗传的,那么可以在多项式时间内检查子群的F-子正规性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Symbolic Computation
Journal of Symbolic Computation 工程技术-计算机:理论方法
CiteScore
2.10
自引率
14.30%
发文量
75
审稿时长
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.
期刊最新文献
Editorial Board Wilf-Zeilberger seeds and non-trivial hypergeometric identities Fast evaluation of generalized Todd polynomials: Applications to MacMahon's partition analysis and integer programming The conjugacy problem and canonical representatives in finitely generated nilpotent groups On the existence of telescopers for P-recursive sequences
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1