Refinement of Higher-Rank Graph Reduction
From MaRDI portal
Abstract: Given a row-finite, source-free, graph of rank , we extend the definition of reduction from introduced by Eckhardt et al [arXiv:2006.13441]. This constitutes a large step forward in the extension of the geometric classification of finite directed graph -algebras given by Eilers et al [ERRS21]. to higher-rank graph -algebras. In particular, this new move acts as an inverse to delay, directly extends the move called reduction in [arXiv:2006.13441], and provides previously undocumented Morita classes of -graphs. Additionally, this move is more robust in its application to product graphs than its predecessor. The methodology used to refine reduction is of particular note. That is, we define a neighborhood of a vertex which is vital in codifying the global influence that local changes have on a -graph.
This page was built for publication: Refinement of Higher-Rank Graph Reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419090)
