|
Algorithms in direct decompositions of torsion free abelian groups
E. A. Blagoveshchenskayaab, L. Strüngmannc a Emperor Alexander I St. Petersburg State Transport University
b Peter the Great St. Petersburg Polytechnic University
c University of Applied Sciences, Mannheim, Germany
Abstract:
The graphical theory of direct decompositions of torsion-free abelian groups of a certain type is considered as the basis for the algorithmic construction of the set of their direct decompositions satisfying some specified conditions.
Keywords:
torsion-free abelian group of finite rank, direct decomposition, almost isomorphism, $r$-colorable graph, algorithm.
Citation:
E. A. Blagoveshchenskaya, L. Strüngmann, “Algorithms in direct decompositions of torsion free abelian groups”, Proceedings of the XVII All-Russian Youth School-Conference «Lobachevsky Readings-2018»,
November 23-28, 2018, Kazan. Part 2, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 176, VINITI, Moscow, 2020, 19–25
Linking options:
https://www.mathnet.ru/eng/into583 https://www.mathnet.ru/eng/into/v176/p19
|
Statistics & downloads: |
Abstract page: | 271 | Full-text PDF : | 80 | References: | 35 |
|