Teresa Bates

Flow equivalence of graph algebras

This paper explores the effect of various graphical constructions upon the associated graph C∗-algebras. The graphical constructions in question arise naturally in the study of flow equivalence for topological Markov chains. We prove that out-splittings give rise to isomorphic graph algebras, and in-splittings give rise to strongly Morita equivalent C∗-algebras. We generalize the notion of a delay as defined in (D. Drinen, Preprint, Dartmouth College, 2001) to form in-delays and out-delays. We prove that these constructions give rise to Morita equivalent graph C∗-algebras. We provide examples which suggest that our results are the most general possible in the setting of the C∗-algebras of arbitrary directed graphs.

C∗-algebras of labelled graphs III-K-theory computations

In this paper we give a formula for the

THE C -ALGEBRAS OF ROW-FINITE GRAPHS

K

The ideal structure of the

-theory of the

C\sp *

C^{\ast }

-algebras of infinite graphs

-algebra of a weakly left-resolving labelled space. This is done by realizing the

C*-algebras of labeled graphs

C^{\ast }

C*-algebras of labelled graphs II - simplicity results

-algebra of a weakly left-resolving labelled space as the Cuntz–Pimsner algebra of a

Reducibility of covers of AFT shifts

C^{\ast }

Algebras of row-finite graphs

-correspondence. As a corollary, we obtain a gauge-invariant uniqueness theorem for the