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

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

Displaying similar documents to “Computational algorithms for deciding some problems for nilpotent groups”

Some remarks on almost finitely generated nilpotent groups.

Peter Hilton, Robert Militello (1992)

Publicacions Matemàtiques

Similarity:

We identify two generalizations of the notion of a finitely generated nilpotent. Thus a nilpotent group G is fgp if Gp is fg as p-local group for each p; and G is fg-like if there exists a fg nilpotent group H such that Gp ≅ Hp for all p. The we have proper set-inclusions: {fg} ⊂ {fg-like} ⊂ {fgp}. We examine the extent to which fg-like nilpotent groups satisfy the axioms for...

Group rings with FC-nilpotent unit groups.

Vikas Bist (1991)

Publicacions Matemàtiques

Similarity:

Let U(RG) be the unit group of the group ring RG. Groups G such that U(RG) is FC-nilpotent are determined, where R is the ring of integers Z or a field K of characteristic zero.

Groups with many nilpotent subgroups

Patrizia Longobardi, Mercede Maj, Avinoam Mann, Akbar Rhemtulla (1996)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

Nil series from arbitrary functions in group theory

Ian Hawthorn (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In an earlier paper distributors were defined as a measure of how close an arbitrary function between groups is to being a homomorphism. Distributors generalize commutators, hence we can use them to try to generalize anything defined in terms of commutators. In this paper we use this to define a generalization of nilpotent groups and explore its basic properties.

On a theorem of Schur.

Hilton, Peter (2001)

International Journal of Mathematics and Mathematical Sciences

Similarity: