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

In this paper, we study the ideal structure of reduced $C^*$-algebras $C^*_r(G)$ associated to \'etale groupoids $G$. In particular, we characterize when there is a one-to-one correspondence between the closed, two-sided ideals in…

We will introduce a notion of normal subshifts. A subshift $(\Lambda,\sigma)$ is said to be normal if it satisfies a certain synchronizing property called $\lambda$-synchronizing and is infinite as a set. We have lots of purely infinite…

We develop a theory of type semigroups for arbitrary twisted, not necessarily Hausdorff \'etale groupoids. The type semigroup is a dynamical version of the Cuntz semigroup. We relate it to traces, ideals, pure infiniteness, and stable…

In this paper, we characterize properly purely infinite Steinberg algebras $A_K(\mathcal{G})$ for strongly effective, ample Hausdorff groupoids $\mathcal{G}$. As an application, when $\Lambda$ is a strongly aperiodic $k$-graph, we show that…

We introduce an algebraic version of the Katsura $C^*$-algebra of a pair $A,B$ of integer matrices and an algebraic version of the Exel-Pardo $C^*$-algebra of a self-similar action on a graph. We prove a Graded Uniqueness Theorem for such…

We show that if A is a separable, nuclear, O_infty-absorbing (or strongly purely infinite) C*-algebra, which is homotopic to zero in an ideal-system preserving way, then A is the inductive limit of C*-algebras of the form M_k(C_0(G,v)),…

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…

We study the extremal problem that relates the spectral radius $\lambda (G)$ of an $F$-free graph $G$ with its number of edges. Firstly, we prove that for any graph $F$ with chromatic number $\chi (F)=r+1\ge 3$, if $G$ is an $F$-free graph…

We give necessary and sufficient conditions on a row-finite graph E so that the Leavitt path algebra L(E) is purely infinite simple. This result provides the algebraic analog to the corresponding result for the Cuntz-Krieger C$^*$-algebra…

Given a simple graph $G$, the {\it irregularity strength} of $G$, denoted by $s(G)$, is the least positive integer $k$ such that there is a weight assignment on edges $f: E(G) \to \{1,2,\dots, k\}$ attributing distinct weighted degrees:…

We characterise quasidiagonality of the $C^*$-algebra of a cofinal $k$-graph in terms of an algebraic condition involving the coordinate matrices of the graph. This result covers all simple $k$-graph $C^*$-algebras. In the special case of…

We prove Leavitt path algebra versions of the two uniqueness theorems of graph C*-algebras. We use these uniqueness theorems to analyze the ideal structure of Leavitt path algebras and give necessary and sufficient conditions for their…

We extend Nekrashevych's $KK$-duality for $C^*$-algebras of regular, recurrent, contracting self-similar group actions to regular, contracting self-similar groupoid actions on a graph, removing the recurrence condition entirely and…

We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite…

We consider the simplicity of the $C^*$-algebra associated to a labelled space $(E,\CL,\bE)$, where $(E,\CL)$ is a labelled graph and $\bE$ is the smallest accommodating set containing all generalized vertices. We prove that if $C^*(E, \CL,…

Building on previous work of Kadison--Ringrose, Elliott, Akemann--Pedersen, and this author, we prove a dichotomy for the relation of outer equivalence of derivations and unitary equivalence of derivable automorphisms for a separable…

For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…

We introduce a graph theoretic property called Condition (N) for finitely separated graphs and prove that it is equivalent to both nuclearity and exactness of the associated universal tame graph C*-algebra.

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

To a graph $\Gamma$ one can associate a C^*-algebra $C^*(\Gamma)$ generated by isometries. Such $C^*$-algebras were studied recently by Crisp and Laca. They are a special case of the Toeplitz C^*-algebras $\mathcal{T}(G, P)$ associated to…