加载中…
Higher rank graphs, also known as -graphs, are a -dimensional generalization of directed graphs and a rich source of examples of -algebras. In the present paper, we contribute to the geometric classification program for -graph -algebras by introducing a new move on -graphs, called LiMaR-split, which is a generalization of outsplit for directed graphs. We show, under one additional assumption, that LiMaR-split preserves the -graph -algebras up to Morita equivalence.

生成讲解博客的中文版本

生成AI智能校验的中文版本