Higher Rank Graph C-Algebras

By Alex Kumjian, David Pask. 2000

154 citations recorded by the source corpus.

Building on recent work of Robertson and Steger, we associate a C{algebra to a combinatorial object which may be thought of as a higher rank graph. This C{algebra is shown to be isomorphic to that of the associ- ated path groupoid. Various results in this paper give sucient conditions on the higher rank graph for the associated C{algebra to be: simple, purely in- nite and AF. Results concerning the structure of crossed products by certain natural actions of discrete groups are obtained; a technique for constructing rank 2 graphs from \commuting" rank 1 graphs is given.

Subfields: Algebra and Number Theory, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/4fa1fa111c05089e45b58e467997449d53896f25

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Aidan Sims
  2. Trent Yeend
  3. David Pask
  4. Iain Raeburn
  5. A. Rennie
  6. N. Fowler
  7. R. Exel
  8. K. Davidson

In Mathematical Physics

  1. Aidan Sims
  2. Trent Yeend
  3. David Pask
  4. Iain Raeburn
  5. A. Rennie
  6. N. Fowler
  7. R. Exel
  8. K. Davidson

Citations in the corpus