Results 101 to 110 of about 52,812 (244)

On Algebraic and Definable Closures for Theories of Abelian Groups

open access: yesИзвестия Иркутского государственного университета: Серия "Математика"
Classifying abelian groups and their elementary theories, a series of characteristics arises that describe certain features of the objects under consideration.
In.I. Pavlyuk
doaj   +1 more source

Large Abelian Subgroups of Finitep-Groups

open access: yesJournal of Algebra, 1997
Let \(p\) be a prime and let \(G\) be a finite \(p\)-group. Let \(d(G)\) be the maximum of \(| A|\) as \(A\) ranges over the abelian subgroups of \(G\), and \({\mathcal A}(G)\) be the set of all abelian subgroups \(A\) for which \(| A|=d(G)\). Let \(B\) be an abelian subgroup of \(G\) normalized by \(A\) and \(B\) does not normalize \(A\).
openaire   +1 more source

Groups whose proper subgroups of infinite rank have polycyclic-by-finite conjugacy classes [PDF]

open access: yesInternational Journal of Group Theory, 2016
A group G is said to be a (PF)C-group or to have polycyclic-by-finite conjugacy classes, if G/C_{G}(x^{G}) is a polycyclic-by-finite group for all xin G. This is a generalization of the familiar property of being an FC-group.
Mounia Bouchelaghem, Nadir Trabelsi
doaj  

Groups with minimax commutator subgroup [PDF]

open access: yesInternational Journal of Group Theory, 2014
A result of Dixon, Evans and Smith shows that if $G$ is a locally (soluble-by-finite) group whose proper subgroups are (finite rank)-by-abelian, then $G$ itself has this property, i.e. the commutator subgroup of~$G$ has finite rank.
Francesco de Giovanni, Trombetti
doaj  

Tame logarithmic signatures of abelian groups

open access: yesJournal of Mathematical Cryptology, 2017
The security of the asymmetric cryptosystem MST1{{}_{1}} relies on the hardness of factoring group elements with respect to a logarithmic signature. In this paper we investigate the factorization problem with respect to logarithmic signatures of abelian ...
Reichl Dominik
doaj   +1 more source

Home - About - Disclaimer - Privacy