Algorithms for permutability in finite groups.

DOI10.2478/s11533-013-0299-4zbMath1294.20026OpenAlexW2040833878MaRDI QIDQ2440508

Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Ramón Esteban-Romero

Publication date: 19 March 2014

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/39083

zbMATH Keywords

algorithmsfinite groupspermutable subgroupsfinite T-groupsPST-groupsPT-groupsSylow-permutable subgroupspermutability properties

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Software, source code, etc. for problems pertaining to group theory (20-04) Products of subgroups of abstract finite groups (20D40)

Related Items

Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality, permut

Uses Software

• GAP

Cites Work

• Products of finite groups.
• Subgroups permutable with all Sylow subgroups
• Groups in which Sylow subgroups and subnormal subgroups permute.
• Subgroup lattices of groups
• Criteria for permutability to be transitive in finite groups
• Permutable subnormal subgroups of finite groups.
• The embedding of quasinormal subgroups in finite groups
• Sylow permutable subnormal subgroups of finite groups II
• Corrigendum. A note on finite -groups
• A note on finite 𝒫𝒮𝒯-groups
• A Local Approach to Certain Classes of Finite Groups
• Finite soluble groups whose subnormal subgroups permute with certain classes of subgroups
• A Note on Finite Groups in Which Normality is Transitive
• Endliche Gruppen I