Removing sources from higher-rank graphs

Mathematics – Operator Algebras

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

34 pages, uses XY-pic, rewrote Theorem 3.24, added Theorem 3.26, corrected typos

Scientific paper

For a higher-rank graph $\Lambda$ with sources we detail a construction that
creates a higher-rank graph $\bar{\Lambda}$ that does not have sources and
contains $\Lambda$ as a subgraph. Furthermore, when $\Lambda$ is row-finite,
the Cuntz-Krieger algebra of $\Lambda$ is a full corner of
$C^*(\bar{\Lambda})$, the Cuntz-Krieger algebra of $\bar{\Lambda}$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Removing sources from 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 Removing sources from higher-rank graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Removing sources from higher-rank graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-369372

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.