arXiv · 1812.04555
Decidability of flow equivalence and isomorphism problems for graph C*-algebras and quiver representations
Abstract
We note that the deep results of Grunewald and Segal on algorithmic problems for arithmetic groups imply the decidability of several matrix equivalence problems involving poset-blocked matrices over Z. Consequently, results of Eilers, Restorff, Ruiz and S{\o}rensen imply that isomorphism and stable isomorphism of unital graph C*-algebras (including the Cuntz-Krieger algebras) are decidable. One can also decide flow equivalence for shifts of finite type, and isomorphism of Z-quiver representations (i.e., finite diagrams of homomorphisms of finitely generated abelian groups).
Explore related subjects
Keep this discovery
Mike Boyle, Benjamin Steinberg. 2018-12-11. Decidability of flow equivalence and isomorphism problems for graph C*-algebras and quiver representations. https://arxiv.org/abs/1812.04555
Cite the original work for its findings. Save a collection to share your selection of sources.