Open Access. Powered by Scholars. Published by Universities.®
Social and Behavioral Sciences Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Social and Behavioral Sciences
Induced C*-Algebras, Coactions And Equivariance In The Symmetric Imprimitivity Theorem, Siegfried Echterhoff, Iain Raeburn
Induced C*-Algebras, Coactions And Equivariance In The Symmetric Imprimitivity Theorem, Siegfried Echterhoff, Iain Raeburn
Faculty of Engineering and Information Sciences - Papers: Part A
The symmetric imprimitivity theorem provides a Morita equivalence between two crossed products of induced C*-algebras and includes as special cases many other important Morita equivalences such as Green's imprimitivity theorem. We show that the symmetric imprimitivity theorem is compatible with various inflated actions and coactions on the crossed products.
The C*-Algebras Of Row-Finite Graphs, Teresa Bates, David Pask, Iain Raeburn, Wojciech Szymanski
The C*-Algebras Of Row-Finite Graphs, Teresa Bates, David Pask, Iain Raeburn, Wojciech Szymanski
Faculty of Engineering and Information Sciences - Papers: Part A
We prove versions of the fundamental theorems about Cuntz-Krieger algebras for the C*-algebras of row-finite graphs: directed graphs in which each vertex emits at most finitely many edges. Special cases of these results have previously been obtained using various powerful machines; our main point is that direct methods yield sharper results more easily.
The C*-Algebras Of Infinite Graphs, Neal J. Fowler, Marcelo Laca, Iain Raeburn
The C*-Algebras Of Infinite Graphs, Neal J. Fowler, Marcelo Laca, Iain Raeburn
Faculty of Engineering and Information Sciences - Papers: Part A
We associate C*-algebras to infinite directed graphs that are not necessarily locally finite. By realizing these algebras as Cuntz-Krieger algebras in the sense of Exel and Laca, we are able to give criteria for their uniqueness and simplicity, generalizing results of Kumjian, Pask, Raeburn, and Renault for locally finite directed graphs.