Related papers: A dichotomy for simple self-similar graph $C^\ast$…

We describe simplicity of the Stacey crossed product A\times_\beta \N in terms of conditions of the endomorphism \beta. Then, we use a characterization of the graph C*-algebras C*(E) as the Stacey crossed product…

In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let $G=(V,E)$ be a primitive strongly regular graph with parameters $(v,k,\lambda,\mu)$. Let $S(G,H)$ be the graph from $G$ by switching with…

These notes were originally intended to be complementary material for an introductory course on self-similar graphs and their algebras, presented by the author at the CIMPA School ``K-theory and Operator Algebras'', held in La Plata and…

We show that the equivariant $E$-theory category $\mathrm{E}_{\mathrm{sep}}^{G}$ for separable $C^{*}$-algebras is a compactly assembled stable $\infty$-category. We derive this result as a consequence of the shape theory for…

Let $G$ be a finite insoluble group with soluble radical $R(G)$. In this paper we investigate the soluble graph of $G$, which is a natural generalisation of the widely studied commuting graph. Here the vertices are the elements in $G…

The problem of inner vs outer conjugacy of subalgebras of certain graph C*-algebras is investigated. For a large class of finite graphs E, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph…

A $\lambda$-graph system ${\frak L}$ is a generalization of a finite labeled graph and presents a subshift. We will prove that the topological dynamical systems $(X_{{\frak L}_1},\sigma_{{\frak L}_1})$ and $(X_{{\frak L}_2},\sigma_{{\frak…

Let A_E be the canonical AF subalgebra of a graph C*-algebra C*(E) associated with a locally finite directed graph E. For Brown-Voiculescu's topological entropy ht(\Phi_E) of the canonical completely positive map \Phi_E on C*(E),…

It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $\Lambda$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $\Lambda$. Moreover, the set of…

We give a complete $K$-theoretical description of when an extension of two simple graph $C^{*}$-algebras is again a graph $C^{*}$-algebra.

Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…

In this paper, we describe primitive ideal space of the $C^*$-algebra $C^*(\Lambda)$ associated to any locally convex row-finite $k$-graph $\Lambda$. To do this, we will apply the Farthing's desourcifying method on a recent result of…

In this paper, we introduce the comaximal graph $\Gamma(L)$ of a finite-dimensional Lie algebra $L$, whose vertices are the nontrivial proper Lie subalgebras of $L$ over a field $\mathbb{F}$, and two vertices $A$ and $B$ are adjacent if and…

We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…

We characterize the simplicity of universal C$^*$-algebras arising from multispinal groups. Let $\mathcal{O}_{G_{\max}}$ be the universal C$^*$-algebra associated to a multispinal group $G$. We show that the invertibility of a matrix…

An example is given of a simple, unital C*-algebra which contains an infinite and a non-zero finite projection. This C*-algebra is also an example of an infinite simple C*-algebra which is not purely infinite. A corner of this C*-algebra is…

We prove that if E and F are graphs with a finite number of vertices and an infinite number of edges, if K is a field, and if L_K(E) and L_K(F) are simple Leavitt path algebras, then L_K(E) is Morita equivalent to L_K(F) if and only if…

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

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…

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…