DECOMPOSING B (1)-GROUPS: AN ALGORITHM

DOI10.1081/AGB-120015998zbMath1019.20021MaRDI QIDQ4795915

Clorinda De Vivo, Claudia Metelli

Publication date: 11 September 2003

Published in: Communications in Algebra (Search for Journal in Brave)

zbMATH Keywords

algorithmsquasi-decompositionspure rank-one subgroups\(B^{(1)}\)-groupsquasi-homomorphism categories

Mathematics Subject Classification ID

Direct sums, direct products, etc. for abelian groups (20K25) Subgroups of abelian groups (20K27) Torsion-free groups, finite rank (20K15)

Related Items (5)

On vector spaces with distinguished subspaces and redundant base. ⋮ Abelian group theory in Italy. ⋮ A condition of indecomposability for Butler \(\mathrm B(n)\)-groups. ⋮ Settings for a study of finite rank Butler groups. ⋮ Pure \(B(n)\)-subgroups of completely decomposable groups.

This page was built for publication: DECOMPOSING B ⁽¹⁾-GROUPS: AN ALGORITHM