2000 character limit reached
Faithful representations of graph algebras via branching systems
Published 11 Dec 2014 in math.OA | (1412.3558v1)
Abstract: We continue to investigate branching systems of directed graphs and their connections with graph algebras. We give a sufficient condition under which the representation induced from a branching system of a directed graph is faithful and construct a large class of branching systems that satisfy this condition. We finish the paper by providing a proof of the converse of the Cuntz-Krieger uniqueness theorem for graph algebras by means of branching systems.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.