Algorithms in direct decompositions of torsion-free abelian groups

DOI10.1007/S10958-023-06695-5MaRDI QIDQ6184086zbMATH OpenOpenAlexFDO

Authors Ekaterina Blagoveshchenskaya, Lutz Strüngmann

Publication date 24 January 2024

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-023-06695-5

zbMATH Keywords

algorithmdirect decompositiontorsion-free abelian group of finite ranknear isomorphism\(r\)-colorable graph

Mathematics Subject Classification ID

Torsion-free groups, finite rank (20K15)

Recommendations

• Direct decomposition theory of torsion-free abelian groups of finite rank: graph method
• Direct decompositions of torsion-free abelian groups
• Pure subgroups of completely decomposable groups and a group class problem.
• Direct decompositions of uniform groups
• Decompositions of decidable abelian groups

Cites work

• scientific article; zbMATH DE number 3830205 (Why is no real title available?)
• scientific article; zbMATH DE number 146385 (Why is no real title available?)
• scientific article; zbMATH DE number 1361381 (Why is no real title available?)
• scientific article; zbMATH DE number 701878 (Why is no real title available?)
• scientific article; zbMATH DE number 3332554 (Why is no real title available?)
• Almost completely decomposable groups with primary regulator quotients and their endomorphism rings
• Direct decomposition theory of torsion-free abelian groups of finite rank: graph method
• Finite rank torsion free Abelian groups and rings
• Graph theory with applications

Cited in

(1)

• Matrix structures in the form of finite direct sums and chains

This page was built for publication: Algorithms in direct decompositions of torsion-free abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184086)