All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2 Next

Displaying 21 – 40 of 246

Showing per page

Algorithms for permutability in finite groups

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

Open Mathematics

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.

Conditions for p-supersolubility and p-nilpotency of finite soluble groups

Wenai Yan, Baojun Li, Zhirang Zhang (2013)

Colloquium Mathematicae

Let ℨ be a complete set of Sylow subgroups of a group G. A subgroup H of G is called ℨ-permutably embedded in G if every Sylow subgroup of H is also a Sylow subgroup of some ℨ-permutable subgroup of G. By using this concept, we obtain some new criteria of p-supersolubility and p-nilpotency of a finite group.

Do finite Bruck loops behave like groups?

B. Baumeister (2012)

Commentationes Mathematicae Universitatis Carolinae

This note contains Sylow's theorem, Lagrange's theorem and Hall's theorem for finite Bruck loops. Moreover, we explore the subloop structure of finite Bruck loops.

Currently displaying 21 – 40 of 246