Abstract:Combinatorics of graphs is a very powerful tool to unravel various properties of graph algebras. In particular, isomorphisms between graph algebras are often implemented by moves between their graphs. In this paper, we make these combinatorial methods functorial, and show that collapsing an out-split graph to the original graph and transforming a graph to a shifted graph can be implemented by admissible graph homomorphisms and admissible path homomorphisms, respectively. To include the inverses of such isomorphisms, we introduce a new category of graphs where morphisms are given as regular homomorphisms of graph inverse semigroups. This new category admits a covariant functor to the category of C*-algebras and $*$-homomorphisms which extends the known covariant functor from the category of graphs and admissible path homomorphisms.
From: Piotr M. Hajac [view email]
[v1]
Sat, 13 Jun 2026 19:11:43 UTC (45 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。