On constructive nilpotent groups

Abstract

In connection with the development of the theory of algorithms a study of the problems of computability of important classes of algebraic systems are currently relevant. Groups of unitriangular matrices over the ring are a classic representative of the class of nilpotent groups and have numerous applications both in group theory and in its applications. In this paper we investigate the questions of computability of nilpotent groups. The connection between the bases of the subgroup of the nilpotent torsion-free group and the quotient of this subgroup are found here. Sufficient condition of computability of nilpotent groups in terms of their subgroups and quotient by this subgroup are given. On the basis of these conditions, we exhibit find a large class of computable subgroups of the group of unitriangular matrices of degree 3 over the ring of polynomials in one variable with integer coefficients. In particular, it is proved that every Abelian subgroup of this group is computable. It has been established that any computable numbering of a non-Abelian subgroup of the group of all unitriangular matrices of degree 3 over the polynomial ring in one variable with integer coefficients induces in any computable numbering its maximal subgroups and quotient of it. We obtain a sufficient condition for computability of the quotient of a computable nilpotent group by its periodic part. We find a sufficient condition for computability of a nilpotent group, enriched by an additional predicate root extraction.