Displaying 21 – 40 of 273

Showing per page

On absolutely-nilpotent of class k groups

Patrizia Longobardi, Trueman MacHenry, Mercede Maj, James Wiegold (1995)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

A group G in a variety V is said to be absolutely- V , and we write G A V , if central extensions by G are again in V . Absolutely-abelian groups have been classified by F. R. Beyl. In this paper we concentrate upon the class A N k of absolutely-nilpotent of class k groups. We prove some closure properties of the class A N k and we show that every nilpotent of class k group can be embedded in an A N k -gvoup. We describe all metacyclic A N k -groups and we characterize 2 -generator and infinite 3 -generator A N 2 -groups. Finally...

On almost normal subgroups of supersoluble groups

Carmela Musella (1999)

Bollettino dell'Unione Matematica Italiana

Un sottogruppo H di un gruppo G si dice «almost normal» se ha soltanto un numero finito di coniugati in G , e ovviamente l'insieme a n G costituito dai sottogruppi almost normal di G è un sottoreticolo del reticolo L G di tutti i sottogruppi di G . In questo articolo vengono studiati gli isomorfismi tra reticoli di sottogruppi almost normal, provando in particolare che se G è un gruppo supersolubile e G ¯ è un gruppo FC-risolubile tale che i reticoli a n G e a n G ¯ sono isomorfi, allora anche G ¯ è supersolubile, e...

On an algorithm to decide whether a free group is a free factor of another

Pedro V. Silva, Pascal Weil (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F . Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in the rank of F . We show that the latter dependency can be made exponential in the rank difference rank ( F ) - rank ( H ) , which often makes a significant change.

On an algorithm to decide whether a free group is a free factor of another

Pedro V. Silva, Pascal Weil (2007)

RAIRO - Theoretical Informatics and Applications

We revisit the problem of deciding whether a finitely generated subgroup H is a free factor of a given free group F. Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of H and exponential in the rank of F. We show that the latter dependency can be made exponential in the rank difference rank(F) - rank(H), which often makes a significant change.

On automorphisms fixing subnormal subgroups of soluble groups

Silvana Franciosi, Francesco de Giovanni (1988)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

The group A u t s n G of all automorphisms leaving invariant every subnormal subgroup of the group G is studied. In particular it is proved that A u t s n G is metabelian if G is soluble, and that A u t s n G is either finite or abelian if G is polycyclic.

Currently displaying 21 – 40 of 273