Crossed products for interactions and graph algebras
B. K. Kwa\'sniewski

TL;DR
This paper develops a comprehensive framework for analyzing crossed products arising from Exel's interactions, especially those linked to graph algebras, providing new theorems, criteria, and K-theory calculations.
Contribution
It introduces a unified approach to crossed products for interactions, including those from graphs, with new theorems, simplicity criteria, and a novel K-theory computation method.
Findings
Established a uniqueness theorem for the crossed product
Provided a simplicity criterion for the algebra
Developed a new K-theory calculation method
Abstract
We consider Exel's interaction over a unital -algebra , such that and are hereditary subalgebras of . For the associated crossed product, we obtain a uniqueness theorem, ideal lattice description, simplicity criterion and a version of Pimsner-Voiculescu exact sequence. These results cover the case of crossed products by endomorphisms with hereditary ranges and complementary kernels. As model examples of interactions not coming from endomorphisms we introduce and study in detail interactions arising from finite graphs. The interaction associated to a graph acts on the core of the graph algebra . By describing a partial homeomorphism of dual to we find Cuntz-Krieger uniqueness theorem, criteria for gauge-invariance of all ideals and simplicity of as results concerning reversible noncommutative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
