PreprintarXiv licencearXiv
On C*-nuclearity of graph operator systems
Abstract
We classify the set of finite simple undirected graphs whose corresponding graph operator system is C*-nuclear. We prove that the operator system associated to the graph is C*-nuclear if and only if the graph is 2-chordal, as defined by McCullough. In particular, we present the first known example of a non-chordal graph whose graph operator system is C*-nuclear, as well as the first known examples of graph operator systems which are not C*-nuclear.
Related
- K-theoretic invariants of the Toeplitz operator system and its dual, and of all graph operator systems
- Optimization Inverse Spectral Problem for the Schrödinger Operator on a Compact Graph
- Poisson problem with Hardy operator on lattice graph $ \mathbb{Z}^d$ and the application to semilinear equations
- K-theoretic invariants of four three-dimensional operator systems
- FOCUS: An Adaptive Fractional Graph-Diffusion Attention Operator, with a Preliminary Hallucination-Warning Application
BibTeX
@misc{doron2026cnuclearity,
title = {{On C*-nuclearity of graph operator systems}},
author = {Adam Dor-On and Travis Russell},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.01676},
eprint = {2610.01676},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.01676},
}
RIS
TY - UNPB
TI - On C*-nuclearity of graph operator systems
AU - Adam Dor-On
AU - Travis Russell
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.01676
UR - https://arxiv.org/abs/2610.01676
AB - We classify the set of finite simple undirected graphs whose corresponding graph operator system is C*-nuclear. We prove that the operator system associated to the graph is C*-nuclear if and only if the graph is 2-chordal, as defined by McCullough. In particular, we present the first known example of a non-chordal graph whose graph operator system is C*-nuclear, as well as the first known examples of graph operator systems which are not C*-nuclear.
ER -