A. Ballester-Bolinches, Enric Cosme Llópez, R. Esteban-Romero
{"title":"有限群的置换算法","authors":"A. Ballester-Bolinches, Enric Cosme Llópez, R. Esteban-Romero","doi":"10.2478/s11533-013-0299-4","DOIUrl":null,"url":null,"abstract":"In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.","PeriodicalId":50988,"journal":{"name":"Central European Journal of Mathematics","volume":"81 4","pages":"1914-1922"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2478/s11533-013-0299-4","citationCount":"4","resultStr":"{\"title\":\"Algorithms for permutability in finite groups\",\"authors\":\"A. Ballester-Bolinches, Enric Cosme Llópez, R. Esteban-Romero\",\"doi\":\"10.2478/s11533-013-0299-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.\",\"PeriodicalId\":50988,\"journal\":{\"name\":\"Central European Journal of Mathematics\",\"volume\":\"81 4\",\"pages\":\"1914-1922\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.2478/s11533-013-0299-4\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Central European Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/s11533-013-0299-4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Central European Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/s11533-013-0299-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
