-correspondences for ordinal graphs
arXiv:2602.15148
Abstract
We introduce a family of -correspondences naturally associated to every ordinal graph . When is a directed graph, is isomorphic to the usual -correspondence associated to a graph. We show that ordinal graphs satisfying a weak assumption have the property that the -algebra of is isomorphic to the Cuntz-Pimsner algebra of . As a consequence, the -algebra of may be constructed starting from by iteratively applying the Cuntz-Pimsner construction and inductive limits. We apply this result to strengthen the author's previous Cuntz-Krieger uniqueness theorem.
37 pages, 2 figures