The graph C*-algebra classification conjecture by filtered ordered K-theory
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.