相关论文: Simplicity of 2-graph algebras associated to Dynam…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
In 2004, Hong and Szymanski gave a complete description of the primitive-ideal space of the C*-algebra of a directed graph. This article details a slightly different approach, in the simpler context of row-finite graphs with no sources,…
A $C^*$-textile dynamical system $({\cal A}, \rho,\eta,\Sigma^\rho,\Sigma^\eta, \kappa)$ connsists of a unital $C^*$-algebra ${\cal A}$, two families of endomorphisms ${\rho_\alpha}_{\alpha \in \Sigma^\rho}$ and ${\eta_a}_{a \in…
Given a system of coverings of k-graphs, we show that the cohomology of the resulting (k+1)-graph is isomorphic to that of any one of the k-graphs in the system. We then consider Bratteli diagrams of 2-graphs whose twisted C*-algebras are…
In this paper we generalize the notion of a $k$-graph into (countable) infinite rank. We then define our $C^*$-algebra in a similar way as in $k$-graph $C^*$-algebras. With this construction we are able to find analogues to the Gauge…
A $\lambda$-graph system is a labeled Bratteli diagram with certain additional structure, which presents a subshift. The class of the $C^*$-algebras $\mathcal{O}_{\frak L}$ associated with the $\lambda$-graph systems is a generalized class…
A semigroupoid is a set equipped with a partially defined associative operation. Given a semigroupoid \Lambda we construct a C*-algebra C*(\Lambda) from it. We then present two main examples of semigroupoids, namely the Markov semigroupoid…
For each odd integer $n \geq 3$, we construct a rank-3 graph $\Lambda_n$ with involution $\gamma_n$ whose real C*-algebra $C^*_\mathbb{R}(\Lambda_n, \gamma_n)$ is stably isomorphic to the exotic Cuntz algebra $\mathcal E_n^\mathbb{R}$. This…
We define an ultragraph, which is a generalization of a directed graph, and describe how to associate a C*-algebra to it. We show that the class of ultragraph algebras contains the C*-algebras of graphs as well as the Exel-Laca algebras. We…
We study the structure and compute the stable rank of C*-algebras of finite higher-rank graphs. We completely determine the stable rank of the C*-algebra when the k-graph either contains no cycle with an entrance, or is cofinal. We also…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
In this note we extend the construction of a $C^*$-algebra associated to a self-similar graph to the case of arbitrary countable graphs. We reduce the problem to the row-finite case with no sources, by using a desingularization process.…
We investigate how the fixed point algebra of a C*-dynamical system can differ from the underlying C*-algebra. For any exact group $\Gamma$ and any infinite group $\Lambda$, we construct an outer action of $\Lambda$ on the Cuntz algebra…
We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…
Topological quivers generalize the notion of directed graphs in which the sets of vertices and edges are locally compact (second countable) Hausdorff spaces. Associated to a topological quiver $Q$ is a $C^*$-correspondence, and in turn, a…
Among all simple 2-connected graphs, and among all $\theta$-graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.
We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…
It is known that a graph $C^*$-algebra $C^*(E)$ is approximately finite dimensional (AF) if and only if the graph $E$ has no loops. In this paper we consider the question of when a labeled graph $C^*$-algebra $C^*(E,\CL,\CB)$ is AF. A…
A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…
In this paper, we consider the simplicity of the C*-algebra associated to an arbitrary weakly left-resolving labeled space (E, L, E), where E is the smallest non-degenerate accommodating set. We classify all gauge-invariant ideals of C*(E,…