We prove that for any countable directed graph E E with Condition (K), the associated graph C ∗ C^* -algebra C ∗ ( E ) C^*(E) has nuclear dimension at most 2 2 . Furthermore, we provide a sufficient condition producing an upper bound of 1 1 .
No takes yet. Share an insight, caveat, or question.
Faurot et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: