University of Wollongong
Browse

Aperiodicity and cofinality for finitely aligned higher-rank graphs

Download (218.93 kB)
journal contribution
posted on 2024-11-15, 03:47 authored by Peter Lewin, Aidan SimsAidan Sims
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.

History

Citation

Lewin, P. & Sims, A. (2010). Aperiodicity and cofinality for finitely aligned higher-rank graphs. Cambridge Philosophical Society. Mathematical Proceedings, 149 (2), 333-350.

Journal title

Mathematical Proceedings of the Cambridge Philosophical Society

Volume

149

Issue

2

Pagination

333-350

Language

English

RIS ID

33973

Usage metrics

    Categories

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC