Algorithms in direct decompositions of torsion-free abelian groups (Q6184086)

All groups in this review are abelian. An almost completely decomposable group \(X\) contains a fully invariant completely decomposable subgroup \(A\) of finite index, called the regulator of \(X.\) If the quotient \(X/A\) is a cyclic (torsion) group, then \(X\) is called a crq-group; and if the types of rank-one summands of \(A\) form an antichain, then \(X\) is called block-rigid. Certain of torsion-free abelian groups are examples of groups admitting non-isomorphic direct decompositions, and a classification of such decompositions of the same group is one of the central goals in their investigation. In this context, near-isomorphism which is an equivalence weaker than isomorphism is used for the classification of groups of this class. Moreover, the graphical theory is considered as the basis for the algorithmic construction of the set of their direct decompositions satisfying some specified conditions. In the paper under review, the graphical method is adopted by the authors to generalize the first author's works in [\textit{E. Blagoveshchenskaya} and \textit{D. Kunetz}, Lobachevskii J. Math. 39, No. 1, 29--34 (2018; Zbl 1386.20028)] as follows: Theorem 3.1. Let \(n \geq 2r \geq 6\) be natural numbers. Then there exists a block-rigid crq-group \(X\) of rank \(n,\) which can be decomposed into the direct sums of indecomposable summands of ranks \(l_1, l_2, \hdots, l_t\) and of ranks \(r_1, r_2, \hdots, r_s\) for any sets of numbers if the following conditions hold: \begin{itemize} \item[1.] \(n=l_1 + l_2 + \hdots + l_t = r_1 + r_2 + \hdots + r_s;\) \item[2.] \(r=r_1 > l_1\) if the numbers \(r_1 \geq r_2 \geq \hdots \geq r_s \geq 1\) and \(l_1 \geq l_2 \geq \hdots \geq l_t \geq 1\) are arranged in the descending order; \item[3.] \(r=n-t.\) \end{itemize}