Related papers: Corners of graph algebras
We compute the sheaf cohomology of a groupoid built from a local homeomorphism of a locally compact space $X$. In particular, we identify the twists over this groupoid, and its Brauer group. Our calculations refine those made by Kumjian,…
A kernel of a directed graph is a subset of vertices that is both independent and absorbing (every vertex not in the kernel has an out-neighbour in the kernel). Not all directed graphs contain kernels, and computing a kernel or deciding…
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…
A directed graph $D$ is singly connected if for every ordered pair of vertices $(s,t)$, there is at most one path from $s$ to $t$ in $D$. Graph orientation problems ask, given an undirected graph $G$, to find an orientation of the edges…
We consider a construction of C*-algebras from continuous piecewise monotone maps on the circle which generalizes the crossed product construction for homeomorphisms and more generally the construction of Renault, Deaconu and…
We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…
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…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
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…
Suppose a C*-algebra A acts by adjointable operators on a Hilbert A-module X. Pimsner constructed a C*-algebra O_X which includes, for particular choices of X, crossed products of A by Z, the Cuntz algebras O_n, and the Cuntz-Krieger…
In this paper we give a formula for the $K$-theory of the $C^*$-algebra of a weakly left-resolving labelled space. This is done by realising the $C^*$-algebra of a weakly left-resolving labelled space as the Cuntz-Pimsner algebra of a…
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 introduce the labelling map and the quasi-free action of a locally compact abelian group on a graph $C^*$-algebra of a row-finite directed graph. Some necessary conditions for embedding the crossed product to an $AF$ algebra are…
It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges…
We construct a locally compact Hausdorff topology on the path space of a directed graph $E$, and identify its boundary-path space $\partial E$ as the spectrum of a commutative $C^*$-subalgebra $D_E$ of $C^*(E)$. We then show that $\partial…
We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume that…
Undirected co-graphs are those graphs which can be generated from the single vertex graph by disjoint union and join operations. Co-graphs are exactly the P_4-free graphs (where P_4 denotes the path on 4 vertices). Co-graphs itself and…
Given an undirected graph $G$, let us randomly orient $G$ by tossing independent (possibly biased) coins, one for each edge of $G$. Writing $a\rightarrow b$ for the event that there exists a directed path from a vertex $a$ to a vertex $b$…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…
Quantum symmetry of graph $C^{*}$-algebras has been studied, under the consideration of different formulations, in the past few years. It is already known that the compact quantum group $(\underbrace{C(S^{1})*C(S^{1})*\cdots…