Related papers: When universal edge-colored directed graph $C^*$-a…
We investigate if a unital C(X)-algebra is properly infinite when all its fibres are properly infinite. We show that this question can be rephrased in several different ways, including the question if every unital properly infinite…
The unions of directed graphs are the simplest examples of pushouts of directed graphs. The conditions under which they contravariantly induce surjective gauge-equivariant pullbacks of graph C*-algebras have been well studied and vastly…
For any countable graph $E$, we investigate the relationship between the Leavitt path algebra $L_{\C}(E)$ and the graph C*-algebra $C^*(E)$. For graphs $E$ and $F$, we examine ring homomorphisms, ring *-homomorphisms, algebra homomorphisms,…
We study C*-algebras generated by two partitions of unity subject to orthogonality relations governed by a bipartite graph which we also call "bipartite graph C*-algebras". These algebras generalize at the same time the C*-algebra…
Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…
We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies. when applied to the graph coloring game,…
For a large class of finite graphs $E$, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph $C^*$-algebra $C^*(E)$ such that $\alpha({\mathcal D}_E) \neq{\mathcal D}_E$, where ${\mathcal…
We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.
We give a complete $K$-theoretical description of when an extension of two simple graph $C^{*}$-algebras is again a graph $C^{*}$-algebra.
A coloring of vertices of a given graph is called perfect if the color structure of each ball of radius $1$ in the graph depends only on the color of the ball center. Let $n$ be a positive integer. We consider a lexicographic product of the…
We introduce P-graphs, which are generalisations of directed graphs in which paths have a degree in a semigroup P rather than a length in N. We focus on semigroups P arising as part of a quasi-lattice ordered group (G,P) in the sense of…
We give an example of an exact, stably finite, simple. separable C*-algebra D which is not isomorphic to its opposite algebra. Moreover, D has the following additional properties. It is stably finite, approximately divisible, has real rank…
We study uniform perturbations of crossed product C$^*$-algebras by amenable groups. Given a unital inclusion of C$^*$-algebras $C\subseteq D$ and sufficiently close separable intermediate C$^*$-subalgebras $A$, $B$ for this inclusion with…
We prove new results on generalized derivations on C$^*$-algebras. By considering the triple product $\{a,b,c\} =2^{-1} (a b^* c + c b^* a)$, we introduce the study of linear maps which are triple derivations or triple homomorphisms at a…
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that assigns to each vertex in $G$ a positive integer such that, for each edge $uv$ in $G$,…
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…
We introduce a notion of ideal-related K-theory for rings, and use it to prove that if two complex Leavitt path algebras are Morita equivalent (respectively, isomorphic), then the ideal-related K-theories (respectively, the unital…
A coloring of edges of a graph $G$ is injective if for any two distinct edges $e_1$ and $e_2$, the colors of $e_1$ and $e_2$ are distinct if they are at distance $1$ in $G$ or in a common triangle. Naturally, the injective chromatic index…
Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…
We describe how boundary paths in a graph can be used to construct irreducible representations of the associated graph C*-algebra and the associated Leavitt path algebra. We use this construction to establish two sets of results: First, we…