The Classification Problem for Simple Unital Finite Rank Dimension Groups

2017/09/19 by Paul Ellis, P.J. Ellis, Ellis, Paul
Computer Science · Mathematics · #03E15 (Primary) #06F20 #20E32 #20F50 (Secondary) #Algebraic structures and combinatorial models #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Logic (math.LO) #math.GR #math.LO #msc:03E15 #msc:06F20 #msc:20E32 #msc:20F50

paper · pdf · doi:10.48550/arxiv.1709.06684

32 pages. To be published in Israel Journal of Mathematics

openalex publication_date 2017/09/19 · arxiv created 2017/09/20 · arxiv updated 2017/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Borel complexity of the isomorphism problem for finite-rank unital simple dimension groups increases with rank. This implies that the isomorphism problems for the corresponding classes of Bratteli diagrams and LDA-groups also increase with rank.

Related

• An isomorphism of unitals, and an isomorphism of classical groups
• The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length
• The Isomorphism Problem for Oligomorphic Groups with Weak Elimination of Imaginaries
• On the Weisfeiler-Leman Dimension of Finite Groups
• Borel Complexity of the Isomorphism Relation of Archimedean Orders in Finitely Generated Groups