Decidability of flow equivalence and isomorphism problems for graph C*-algebras and quiver representations

DOI10.1090/proc/15148arXiv1812.04555OpenAlexW3021371512MaRDI QIDQ6049966

No author found.

Publication date: 11 October 2023

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.04555

zbMATH Keywords

flow equivalenceshift of finite typeCuntz-Krieger algebraquiver representationdecidablestable isomorphismgraph C*-algebradiagram isomorphism

Mathematics Subject Classification ID

Representations of quivers and partially ordered sets (16G20) Classifications of (C^*)-algebras (46L35) Symbolic dynamics (37B10)

Related Items (1)

Flow equivalence of G-SFTs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flow equivalence of shifts of finite type via positive factorizations.
• Arithmetic subgroups of algebraic groups
• The complete classification of unital graph \(C^{\ast}\)-algebras: geometric and strong
• A class of C*-algebras and topological Markov chains
• Some general algorithms. I: Arithmetic groups
• A topological invariant of flows on 1-dimensional spaces
• Homology for zero-dimensional nonwandering sets
• The K-theoretical range of Cuntz-Krieger algebras
• Rings with several objects
• Flow equivalence of subshifts of finite type
• Classification of Cuntz-Krieger algebras up to stable isomorphism
• Poset block equivalence of integral matrices
• An Introduction to Symbolic Dynamics and Coding
• The 𝐶*-algebras of infinite graphs

This page was built for publication: Decidability of flow equivalence and isomorphism problems for graph C*-algebras and quiver representations