Results 31 to 40 of about 53,696 (220)

On the permutability of Sylow subgroups with derived subgroups of B-subgroups

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2019
A finite non-nilpotent group G is called a B-group if every proper subgroup of the quotient group  G/Φ(G) is nilpotent. We establish the r-solvability of the group in which some Sylow r-subgroup permutes with the derived subgroups of 2-nilpotent (or 2 ...
Ekaterina V. Zubei
doaj   +1 more source

The solvability of groups with nilpotent minimal coverings [PDF]

open access: yes, 2014
A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a proof that every
Blyth, Russell D.   +2 more
core   +2 more sources

An Engel condition for orderable groups [PDF]

open access: yes, 2014
Let m,n be positive integers, v a multilinear commutator word and w=v^m. We prove that if G is an orderable group in which all w-values are n-Engel, then the verbal subgroup v(G) is locally nilpotent.
Shumyatsky, P., Tortora, A., Tota, M.
core   +1 more source

Equations in nilpotent groups [PDF]

open access: yesProceedings of the American Mathematical Society, 2015
We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also prove that the decision problem for systems of equations is unsolvable in all non-abelian free nilpotent groups.
Hao Liang, Moon Duchin, Michael Shapiro
openaire   +3 more sources

Computing nilpotent quotients in finitely presented Lie rings [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 1997
A nilpotent quotient algorithm for finitely presented Lie rings over Z (and Q) is described. The paper studies the graded and non-graded cases separately.
Csaba Schneider
doaj   +2 more sources

On some groups whose subnormal subgroups are contranormal-free [PDF]

open access: yesInternational Journal of Group Theory
If $G$ is a group, a subgroup $H$ of $G$ is said to be contranormal in $G$ if $H^G = G$, where $H^G$ is the normal closure of $H$ in $G$. We say that a group is contranormal-free if it does not contain proper contranormal subgroups.
Leonid Kurdachenko   +2 more
doaj   +1 more source

Quantifying Residual Finiteness [PDF]

open access: yes, 2010
We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent groups, and ...
Bass   +9 more
core   +2 more sources

On almost finitely generated nilpotent groups

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1996
A nilpotent group G is fgp if Gp, is finitely generated (fg) as a p-local group for all primes p; it is fg-like if there exists a nilpotent fg group H such that Gp≃Hp for all primes p.
Peter Hilton, Robert Militello
doaj   +1 more source

Some Residual Properties of Finite Rank Groups

open access: yesМоделирование и анализ информационных систем, 2014
The generalization of one classical Seksenbaev theorem for polycyclic groups is obtained. Seksenbaev proved that if G is a polycyclic group which is residually finite p-group for infinitely many primes p, it is nilpotent. Recall that a group G is said to
D. N. Azarov
doaj   +1 more source

Definable Envelopes of Nilpotent Subgroups of Groups with Chain Conditions on Centralizers [PDF]

open access: yes, 2011
An $\mathfrak{M}_C$ group is a group in which all chains of centralizers have finite length. In this article, we show that every nilpotent subgroup of an $\mathfrak{M}_C$ group is contained in a definable subgroup which is nilpotent of the same ...
Altınel, Tuna, Baginski, Paul
core   +3 more sources

Home - About - Disclaimer - Privacy