Factoring by nonsubgroup factors.
Corrádi, Keresztély, Szabó, Sándor (1994)
Beiträge zur Algebra und Geometrie
Similarity:
Displaying similar documents to “An axiomatic approach for the Hajós theorem.”
Factoring by nonsubgroup factors.
On semiabelian groups.
Kuzennyi, N.F., Subbotin, I.Ya. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Finite groups whose all second maximal subgroups are cyclic
Li Ma, Wei Meng, Wanqing Ma (2017)
Open Mathematics
Similarity:
In this paper, we give a complete classification of the finite groups G whose second maximal subgroups are cyclic
Abelian subgroups of polycyclic groups.
John S. Wilson (1982)
Journal für die reine und angewandte Mathematik
Similarity:
On the exponent of the product of two groups
Avinoam Mann (2006)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
The Artin exponent of finite groups
Kenneth K. Nwabueze (1997)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
Factoring an odd abelian group by lacunary cyclic subsets
Sándor Szabó (2010)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
It is a known result that if a finite abelian group of odd order is a direct product of lacunary cyclic subsets, then at least one of the factors must be a subgroup. The paper gives an elementary proof that does not rely on characters.
Groups with soluble factor groups and projectivities
Giorgio Busetto, Federico Menegazzo (1985)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Cyclic quasinormal subgroups of arbitrary groups
Stewart E. Stonehewer, Giovanni Zacher (2006)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
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.