Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 17 tok/s Pro
GPT-4o 111 tok/s Pro
Kimi K2 161 tok/s Pro
GPT OSS 120B 412 tok/s Pro
Claude Sonnet 4 35 tok/s Pro
2000 character limit reached

When is the Cuntz-Krieger algebra of a higher-rank graph approximately finite-dimensional? (1112.4549v2)

Published 20 Dec 2011 in math.OA

Abstract: We investigate the question: when is a higher-rank graph C*-algebra approximately finite dimensional? We prove that the absence of an appropriate higher-rank analogue of a cycle is necessary. We show that it is not in general sufficient, but that it is sufficient for higher-rank graphs with finitely many vertices. We give a detailed description of the structure of the C*-algebra of a row-finite locally convex higher-rank graph with finitely many vertices. Our results are also sufficient to establish that if the C*-algebra of a higher-rank graph is AF, then its every ideal must be gauge-invariant. We prove that for a higher-rank graph C*-algebra to be AF it is necessary and sufficient for all the corners determined by vertex projections to be AF. We close with a number of examples which illustrate why our question is so much more difficult for higher-rank graphs than for ordinary graphs.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.