Algorithmic dimension of nilpotent groups

DOI10.1007/BF00971375zbMath0697.20021OpenAlexW2078897677MaRDI QIDQ910855

B. N. Drobotun, Sergei S. Goncharov

Publication date: 1989

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00971375

zbMATH Keywords

lower central seriesrecursive functionautostabilityalgorithmic dimensionconstructible nilpotent groupsenumeration of algebraic systemequivalence classes of enumerations

Mathematics Subject Classification ID

Applications of logic to group theory (20A15) Nilpotent groups (20F18) Derived series, central series, and generalizations for groups (20F14) Theory of numerations, effectively presented structures (03D45)

Related Items (5)

Computable torsion-free nilpotent groups of finite dimension. ⋮ On extension groups in the category of Abelian diagrams ⋮ Estimates of the solutions of linear systems with delay ⋮ On extension groups in the category of Abelian diagrams ⋮ Homotopy equivalence of coverings and the spectral sequence of a fibration

This page was built for publication: Algorithmic dimension of nilpotent groups