# Adam P.W. Sørensen: Classification of graph C*-algebras, without the usual assumptions

Abstract: In the classification program for C*-algebras some of the usual assumptions put on the algebras are that they are simple or have at most have finitely many ideals. We often also want algebras that have real rank 0. In this talk we will discuss how to classify certain graph algebras with uncountably many ideals and without real rank 0. There will be examples and applications. Joint work with S. Eilers, G. Restorff, and E. Ruiz

Published Apr. 7, 2016 4:28 PM