Journal article
Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups
Ergodic theory and dynamical systems, Vol.21(6), pp.1625-1655
2001
DOI: 10.1017/S014338570100178X
Abstract
The notion of isomorphism on stable AF-C^{\ast}-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 incidence matrix. A C^{\ast}-isomorphism induces an equivalence relation on these matrices, called C^{\ast}-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 matrices are C^{\ast}-equivalent or not. Special cases of this problem will be considered in a forthcoming paper.
Details
- Title: Subtitle
- Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups
- Creators
- Ola BratteliPalle E.T JorgensenKi Hang KimFred Roush
- Resource Type
- Journal article
- Publication Details
- Ergodic theory and dynamical systems, Vol.21(6), pp.1625-1655
- DOI
- 10.1017/S014338570100178X
- ISSN
- 0143-3857
- eISSN
- 1469-4417
- Language
- English
- Date published
- 2001
- Academic Unit
- Mathematics
- Record Identifier
- 9983985941502771
Metrics
25 Record Views