The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On semiabelian groups.”

Algorithms for permutability in finite groups

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

Open Mathematics

Similarity:

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.

Unions of subquasigroups

Tomáš Kepka, Pavel Příhoda, Jan Šťovíček (2004)

Acta Universitatis Carolinae. Mathematica et Physica

Similarity:

Groups whose all subgroups are ascendant or self-normalizing

Leonid Kurdachenko, Javier Otal, Alessio Russo, Giovanni Vincenzi (2011)

Open Mathematics

Similarity:

This paper studies groups G whose all subgroups are either ascendant or self-normalizing. We characterize the structure of such G in case they are locally finite. If G is a hyperabelian group and has the property, we show that every subgroup of G is in fact ascendant provided G is locally nilpotent or non-periodic. We also restrict our study replacing ascendant subgroups by permutable subgroups, which of course are ascendant [Stonehewer S.E., Permutable subgroups of infinite groups,...