Noncommutative distances on graphs: An explicit approach via Birkhoff-James orthogonality
Operator Algebras
2024-09-09 v1 Combinatorics
Abstract
We study the problem of calculating noncommutative distances on graphs, using techniques from linear algebra, specifically, Birkhoff-James orthogonality. A complete characterization of the solutions is obtained in the case when the underlying graph is a path.
Cite
@article{arxiv.2409.04146,
title = {Noncommutative distances on graphs: An explicit approach via Birkhoff-James orthogonality},
author = {Pierre Clare and Chi-Kwong Li and Edward Poon and Eric Swartz},
journal= {arXiv preprint arXiv:2409.04146},
year = {2024}
}
Comments
26 pages, 1 figure