Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups

Simple item page
dc.creatorBratteli, Ola
dc.creatorJorgensen, Palle E. T.
dc.creatorKim, Ki Hang
dc.creatorRoush, Fred
dc.date1999-10-19
dc.date2000-08-02
dc.date.accessioned2026-07-07T05:31:13Z
dc.date.available2026-07-07T05:31:13Z
dc.descriptionThe notion of isomorphism of stable AF-C*-algebras is considered in this paper in the case when the corresponding Bratteli diagram is stationary, i.e., is associated with a single square primitive nonsingular incidence matrix. C*-isomorphism induces an equivalence relation on these matrices, called C*-equivalence. We show that the associated isomorphism equivalence problem is decidable, i.e., there is an algorithm that can be used to check in a finite number of steps whether two given primitive nonsingular matrices are C*-equivalent or not.
dc.description55 pages, LaTeX2e (amsart class). In this version the main theorem has been extended to possibly singular primitive integer matrixes, and the clarity of the presentation has been improved substantially throughout the paper
dc.identifierhttps://arxiv.org/abs/math/9910103
dc.identifierhttp://arxiv.org/abs/math/9910103
dc.identifierappeared in Ergodic Theory Dynam. Systems in two parts: 21 (2001), 1625--1655; 22 (2002), 99--127; corrigendum 22 (2002), 633
dc.identifierdoi:10.1017/S014338570100178X 10.1017/S0143385702000044 10.1017/S0143385702000317
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/79263
dc.subjectOperator Algebras
dc.subjectDynamical Systems
dc.subject16D70, 46L35, 58B25
dc.titleDecidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups
dc.typetext

Files

Collections

arXiv