2000 character limit reached
On The Evans Chain Complex
Published 8 Jul 2024 in math.OA | (2407.06065v1)
Abstract: We elaborate on the construction of the Evans chain complex for higher-rank graph $C*$-algebras. Specifically, we introduce a block matrix presentation of the differential maps. These block matrices are then used to identify a wide family of higher-rank graph $C*$-algebras with trivial K-theory. Additionally, in the specialized case where the higher-rank graph consists of one vertex, we are able to use the K\"unneth theorem to explicitly compute the homology groups of the Evans chain complex.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.