Abstract
Given a separated graph (E,C), there are two different C∗-algebras associated to it: the full graph C∗-algebra C∗(E,C) and the reduced one Cred∗(E,C). For a large class of separated graphs (E,C), we prove that Cred∗(E,C) either is purely infinite simple or admits a faithful tracial state. The main tool we use to show pure infiniteness of reduced graph C∗-algebras is a generalization to the amalgamated case of a result on purely infinite simple free products due to Dykema.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
