The graph C*-algebra classification conjecture by filtered ordered K-theory
The graph C*-algebra classification conjecture by filtered ordered K-theory
Let be a graph and let be its graph -algebra. Suppose that has finitely many ideals, and write for its filtered, ordered -theory. Graph C-algebra classification conjecture.* Graph -algebras with finitely many ideals are classified up to stable isomorphism by their filtered, ordered -theory . The conjecture is a proposed classification of graph -algebras by -theoretical invariants. It remains open, and some results suggest that an additional condition of finitely generated -theory may be necessary.
Sources & referencesView supporting material
Primary source
Søren Eilers, Gunnar Restorff and Efren Ruiz, “Classification of graph C*-algebras with no more than four primitive ideals”, arXiv:1212.6750 (2012).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.