Nest representations of directed graph algebras
Kenneth Davidson, Elias Katsoulis

TL;DR
This paper thoroughly investigates nest representations of graph algebras, establishing conditions for their separation of points, faithfulness, and irreducibility based on graph properties like transitivity and cycles.
Contribution
It characterizes when finite dimensional, irreducible, and faithful nest representations exist for graph algebras, linking these to specific graph transitivity and cycle conditions.
Findings
Finite dimensional nest representations separate points in the algebra.
Irreducible finite dimensional representations separate points iff the graph is transitive in components.
Existence of faithful irreducible representations is equivalent to the graph being strongly transitive.
Abstract
This paper is a comprehensive study of the nest representations for the free semigroupoid algebra of countable directed graph as well as its norm-closed counterpart, the tensor algebra . We prove that the finite dimensional nest representations separate the points in , and a fortiori, in . The irreducible finite dimensional representations separate the points in if and only if is transitive in components (which is equivalent to being semisimple). Also the upper triangular nest representations separate points if and only if for every vertex supporting a cycle, also supports at least one loop edge. We also study \textit{faithful} nest representations. We prove that (or ) admits a faithful irreducible representation if and only if is strongly transitive as a directed graph. More generally,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Advanced Topics in Algebra · Algebraic structures and combinatorial models
