Related papers: $\mathcal{Z}$-stable Graph Algebras
A graph $G$ admits an $H$-tiling if it contains a collection of vertex-disjoint copies of $H$. In this paper, we confirm a conjecture proposed by K\"{u}hn, Osthus, and Treglown by showing that for any given graph $H$, there exists a…
This paper is comprised of two related parts. First we discuss which k-graph algebras have faithful gauge invariant traces, where the gauge action of $\T^k$ is the canonical one. We give a sufficient condition for the existence of such a…
Given a topological graph $E$, we give a complete description of tracial states on the C*-algebra $\mathrm{C}^*(E)$ which are invariant under the gauge action; there is an affine homeomorphism between the space of gauge invariant tracial…
We prove that separable C*-algebras which are completely close in a natural uniform sense have isomorphic Cuntz semigroups, continuing a line of research developed by Kadison - Kastler, Christensen, and Khoshkam. This result has several…
It is proved that classifiable simple separable nuclear purely infinite C*-algebras having finitely generated K-theory and torsion-free K_1 are semiprojective. This is accomplished by exhibiting these algebras as C*-algebras of infinite…
In this paper we study free actions of groups on separated graphs and their \cstar{}algebras, generalizing previous results involving ordinary (directed) graphs. We prove a version of the Gross-Tucker Theorem for separated graphs yielding a…
The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that $k$-colorability of a graph $G$ is equivalent to the condition $1 \in…
This dissertation concerns the classification of groupoid and higher-rank graph C*-algebras and has two main components. Firstly, for a groupoid it is shown that the notions of strength of convergence in the orbit space and…
Spielberg's construction of C*-algebras from left cancellative small categories is a common generalization for most C*-algebras one would consider to come from ``combinatorial data,'' including graph and $k$-graph C*-algebras, Li's…
We show that a $C^*$-algebra $\mathfrak{A}$ which is stably isomorphic to a unital graph $C^*$-algebra, is isomorphic to a graph $C^*$-algebra if and only if it admits an approximate unit of projections. As a consequence, a hereditary…
We show that the graph construction used to prove that a gauge-invariant ideal of a graph C*-algebra is isomorphic to a graph C*-algebra, and also used to prove that a graded ideal of a Leavitt path algebra is isomorphic to a Leavitt path…
We prove simplicity and pure infiniteness results for a certain class of labelled graph $C^*$-algebras. We show, by example, that this class of unital labelled graph $C^*$-algebras is strictly larger than the class of unital graph…
We consider directed graphs E which have been obtained by adding a sink to a fixed graph G. We associate an element of Ext(C*(G)) to each such E, and show that the classes of two such graphs are equal in Ext(C*(G)) if and only if the…
Inspired by results for graph $C^*$-algebras, we investigate connections between the ideal structure of an inverse semigroup $S$ and that of its tight $C^*$-algebra by relating ideals in $S$ to certain open invariant sets in the associated…
We study the automorphism group of a unital, simple, $\mathcal{Z}$-stable $C^{*}$-algebra. In this paper, we generalize the results by the authors in \cite{pr_auto} to $\mathcal{Z}$-stable $C^{*}$-algebras $\mathfrak{A}$ such that…
We prove for every graph H there exists a>0 such that, for every graph G with at least two vertices, if no induced subgraph of G is a subdivision of H, then either some vertex of G has at least a|G| neighbours, or there are two disjoint…
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…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
We formalize eight different notions of isomorphism among (unital) graph C*-algebras, and initiate the study of which of these notions may be described geometrically as generated by moves. We propose a list of seven types of moves that we…
In this paper we show that Leavitt path algebras of weighted graphs and Leavitt path algebras of separated graphs are intimately related. We prove that any Leavitt path algebra $L(E,\omega)$ of a row-finite vertex weighted graph…