pith. sign in

arxiv: 1010.3185 · v2 · pith:FEJVMPLAnew · submitted 2010-10-15 · 🧮 math.OA

Obstructions to a general characterization of graph correspondences

classification 🧮 math.OA
keywords correspondencesgraphgraphsobstructionsanalogousarisecharacterizationcharacterizations
0
0 comments X
read the original abstract

For a countable discrete space V, every nondegenerate separable C*-correspondence over c_0(V) is isomorphic to one coming from a directed graph with vertex set V. In this paper we demonstrate why the analogous characterizations fail to hold for higher-rank graphs (where one considers product systems of C*-correspondences) and for topological graphs (where V is locally compact Hausdorff), and we discuss the obstructions that arise.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.