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

Mathematics – Operator Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

55 pages, LaTeX2e (amsart class). In this version the main theorem has been extended to possibly singular primitive integer ma

Scientific paper

10.1017/S014338570100178X 10.101

The 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-713336

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.