Related papers: $C^*$- Colored graph algebras
In the present paper we study the structure of C*-$algebras generated by a certain *-algebra A and a partial isometry inducing an endomorphism of A.
We introduce certain $C^*$-algebras and $k$-graphs associated to $k$ finite dimensional unitary representations $\rho_1,...,\rho_k$ of a compact group $G$. We define a higher rank Doplicher-Roberts algebra $\mathcal{O}_{\rho_1,...,\rho_k}$,…
Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988. The version of this…
We introduce $C^*$-algebras associated with directed graphs, along with two generalizations of this concept, namely Exel-Pardo $C^*$-algebras associated with a self-similar action of a group on a directed graph, and the $C^*$-algebras…
It is determined exactly which classifiable C*-algebras have approximately inner flip. The answer includes a number of C*-algebras with torsion in their K-theory, and a number of C*-algebras that are self-absorbing but not strongly…
More than ten years ago in 2008, a new kind of graph coloring appeared in graph theory, which is the {\it rainbow connection coloring} of graphs, and then followed by some other new concepts of graph colorings, such as {\it proper…
Higher rank semigraph algebras are introduced by mixing concepts of ultragraph algebras and higher rank graph algebras. This yields a kind of higher rank generalisation of ultragraph algebras. We prove Cuntz--Krieger uniqueness theorems for…
In this article we survey some of the recent goings-on in the classification programme of C$^*$-algebras, following the interesting link found between the Cuntz semigroup and the classical Elliott invariant and the fact that the Elliott…
Graph colorings are becoming an increasingly useful family of mathematical models for a broad range of applications, such as time tabling and scheduling, frequency assignment, register allocation, computer security and so on. Graph proper…
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…
What is the probability that a random UHF algebra is of infinite type? What is the probability that a random simple AI algebra has at most $k$ extremal traces? What is the expected value of the radius of comparison of a random…
Conventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated by considerations arising in the field of Qualitative Reasoning, we explore edge colourings…
Higher-rank graphs (or $k$-graphs) were introduced by Kumjian and Pask to provide combinatorial models for the higher-rank Cuntz-Krieger $C^*$-algebras of Robertson and Steger. Here we consider a family of finite 2-graphs whose path spaces…
We generalize a recent construction of Exel and Pardo, from discrete groups acting on finite directed graphs to locally compact groups acting on topological graphs. To each cocycle for such an action, we construct a $C^*$-correspondence…
We study C*-algebras associated with subsemigroups of groups. For a large class of such semigroups including positive cones in quasi-lattice ordered groups and left Ore semigroups, we describe the corresponding semigroup C*-algebras as…
A covering of k-graphs (in the sense of Pask-Quigg-Raeburn) induces an embedding of universal C*-algebras. We show how to build a (k+1)-graph whose universal algebra encodes this embedding. More generally we show how to realise a direct…
We continue to investigate branching systems of directed graphs and their connections with graph algebras. We give a sufficient condition under which the representation induced from a branching system of a directed graph is faithful and…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…
We initiate the study of real $C^*$-algebras associated to higher-rank graphs $\Lambda$, with a focus on their $K$-theory. Following Kasparov and Evans, we identify a spectral sequence which computes the $\mathcal{CR}$ $K$-theory of…