Aperiodicity and cofinality for finitely aligned higher-rank graphs

Details Aperiodicity and cofinality for finitely aligned higher-rank graphs Aperiodicity and cofinality for finitely aligned higher-rank graphs

2009-05-06

arxiv.org/abs/0905.0735v1

Mathematics

Operator Algebras

18 pages

Scientific paper

We introduce new formulations of aperiodicity and cofinality for finitely aligned higher-rank graphs \Lambda, and prove that C*(\Lambda) is simple if and only if \Lambda is aperiodic and cofinal. The main advantage of our versions of aperiodicity and cofinality over existing ones is that ours are stated in terms of finite paths. To prove our main result, we first characterise each of aperiodicity and cofinality of \Lambda in terms of the ideal structure of C*(\Lambda). In an appendix we show how our new cofinality condition simplifies in a number of special cases which have been treated previously in the literature; even in these settings, our results are new.

Affiliated with

Also associated with

No associations

Rating

Aperiodicity and cofinality for finitely aligned higher-rank graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Aperiodicity and cofinality for finitely aligned higher-rank graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Aperiodicity and cofinality for finitely aligned higher-rank graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541172