Direct decompositions of finitely generated torsion-free nilpotent groups

1975 ◽  
Vol 145 (1) ◽  
pp. 1-10 ◽  
Author(s):  
Gilbert Baumslag
Keyword(s):  
Nilpotent Groups ◽  
Finitely Generated ◽  
Direct Decompositions ◽  
Torsion Free

On the Residual Finiteness of Polygonal Products of Nilpotent Groups

1992 ◽  
Vol 35 (3) ◽  
pp. 390-399 ◽  
Author(s):  
Goansu Kim ◽  
C. Y. Tang
Keyword(s):  
Nilpotent Groups ◽  
Vertex Group ◽  
Residual Finiteness ◽  
Finitely Generated ◽  
Residually Finite ◽  
Cyclic Subgroups ◽  
Isolated Subgroup ◽  
Torsion Free

AbstractIn general polygonal products of finitely generated torsion-free nilpotent groups amalgamating cyclic subgroups need not be residually finite. In this paper we prove that polygonal products of finitely generated torsion-free nilpotent groups amalgamating maximal cyclic subgroups such that the amalgamated cycles generate an isolated subgroup in the vertex group containing them, are residually finite. We also prove that, for finitely generated torsion-free nilpotent groups, if the subgroups generated by the amalgamated cycles have the same nilpotency classes as their respective vertex groups, then their polygonal product is residually finite.

Genus of nilpotent groups of Hirsch length six

1995 ◽  
Vol 117 (3) ◽  
pp. 431-438 ◽  
Author(s):  
Charles Cassidy ◽  
Caroline Lajoie
Keyword(s):  
Finite Number ◽  
Nilpotent Group ◽  
Nilpotent Groups ◽  
Finitely Generated ◽  
Torsion Free

AbstractIn this paper, we characterize the genus of an arbitrary torsion-free finitely generated nilpotent group of class two and of Hirsch length six by means of a finite number of arithmetical invariants. An algorithm which permits the enumeration of all possible genera that can occur under the conditions above is also given.

Decision problems concerning S-arithmetic groups

1985 ◽  
Vol 50 (3) ◽  
pp. 743-772 ◽  
Author(s):  
Fritz Grunewald ◽  
Daniel Segal
Keyword(s):  
Additive Group ◽  
Nilpotent Groups ◽  
Isomorphism Problem ◽  
Algorithmic Problem ◽  
Finitely Generated ◽  
Finitely Presented Groups ◽  
Finite Dimensional ◽  
Associative Rings ◽  
Finitely Presented ◽  
Torsion Free

This paper is a continuation of our previous work in [12]. The results, and some applications, have been described in the announcement [13]; it may be useful to discuss here, a little more fully, the nature and purpose of this work.We are concerned basically with three kinds of algorithmic problem: (1) isomorphism problems, (2) “orbit problems”, and (3) “effective generation”.(1) Isomorphism problems. Here we have a class of algebraic objects of some kind, and ask: is there a uniform algorithm for deciding whether two arbitrary members of are isomorphic? In most cases, the answer is no: no such algorithm exists. Indeed this has been one of the most notable applications of methods of mathematical logic in algebra (see [26, Chapter IV, §4] for the case where is the class of all finitely presented groups). It turns out, however, that when consists of objects which are in a certain sense “finite-dimensional”, then the isomorphism problem is indeed algorithmically soluble. We gave such algorithms in [12] for the following cases: = {finitely generated nilpotent groups}; = {(not necessarily associative) rings whose additive group is finitely generated}; = {finitely Z-generated modules over a fixed finitely generated ring}.Combining the methods of [12] with his own earlier work, Sarkisian has obtained analogous results with the integers replaced by the rationals: in [20] and [21] he solves the isomorphism problem for radicable torsion-free nilpotent groups of finite rank and for finite-dimensional Q-algebras.

scholarly journals Finitely generated nilpotent group C*-algebras have finite nuclear dimension

2018 ◽  
Vol 2018 (738) ◽  
pp. 281-298 ◽  
Author(s):  
Caleb Eckhardt ◽  
Paul McKenney
Keyword(s):  
Irreducible Representation ◽  
Nilpotent Group ◽  
Nilpotent Groups ◽  
Irreducible Representations ◽  
Finitely Generated ◽  
C Algebra ◽  
C Algebras ◽  
K Theory ◽  
Universal Coefficient Theorem ◽  
Torsion Free

Abstract We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra A generated by an irreducible representation of such a group has decomposition rank at most 3. If, in addition, A satisfies the universal coefficient theorem, another string of deep results shows it is classifiable by its ordered K-theory and is approximately subhomogeneous. We observe that all C*-algebras generated by faithful irreducible representations of finitely generated, torsion free nilpotent groups satisfy the universal coefficient theorem.

scholarly journals A note on finitely generated torsion-free nilpotent groups of class 2

1979 ◽  
Vol 58 (1) ◽  
pp. 162-175 ◽  
Author(s):  
Fritz J Grunewald ◽  
Rudolf Scharlau
Keyword(s):  
Nilpotent Groups ◽  
Finitely Generated ◽  
Torsion Free

scholarly journals Random nilpotent groups, polycyclic presentations, and Diophantine problems

2017 ◽  
Vol 0 (0) ◽  
Author(s):  
Albert Garreta ◽  
Alexei Miasnikov ◽  
Denis Ovchinnikov
Keyword(s):  
Nilpotent Groups ◽  
Finitely Generated ◽  
Diophantine Problems ◽  
Torsion Free

AbstractWe introduce a model of random finitely generated, torsion-free, 2-step nilpotent groups (in short,

Sign in / Sign up

Export Citation Format

Share Document