Hostname: page-component-8448b6f56d-wq2xx Total loading time: 0 Render date: 2024-04-19T04:32:23.853Z Has data issue: false hasContentIssue false

NEST REPRESENTATIONS OF DIRECTED GRAPH ALGEBRAS

Published online by Cambridge University Press:  18 April 2006

KENNETH R. DAVIDSON
Affiliation:
Pure Mathematics Department, University of Waterloo, Waterloo, ON N2L–3G1, Canadakrdavids@uwaterloo.ca
ELIAS KATSOULIS
Affiliation:
Department of Mathematics, East Carolina University, Greenville, NC 27858, USAKatsoulisE@mail.ecu.edu
Get access

Abstract

This paper is a comprehensive study of the nest representations for the free semigroupoid algebra ${\mathfrak{L}}_G$ of a countable directed graph $G$ as well as its norm-closed counterpart, the tensor algebra ${\mathcal{T}}^{+}(G)$.

We prove that the finite-dimensional nest representations separate the points in ${\mathfrak{L}}_G$, and a fortiori, in ${\mathcal{T}}^{+}(G)$. The irreducible finite-dimensional representations separate the points in ${\mathfrak{L}}_G$ if and only if $G$ 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 $x \in {\mathcal{T}}(G)$ supporting a cycle, $x$ also supports at least one loop edge.

We also study faithful nest representations. We prove that ${\mathfrak{L}}_G$ (or ${\mathcal{T}}^{+}(G)$) admits a faithful irreducible representation if and only if $G$ is strongly transitive as a directed graph. More generally, we obtain a condition on $G$ which is equivalent to the existence of a faithful nest representation. We also give a condition that determines the existence of a faithful nest representation for a maximal type ${\mathbb{N}}$ nest.

Keywords

Type
Research Article
Copyright
2006 London Mathematical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)