Related papers: Refinement of Higher-Rank Graph Reduction

For any row-finite graph $E$ and any field $K$ we construct the {\its Leavitt path algebra} $L(E)$ having coefficients in $K$. When $K$ is the field of complex numbers, then $L(E)$ is the algebraic analog of the Cuntz Krieger algebra…

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 show how to construct a family of groups with simple commutator subgroups from aperiodic 1-vertex, finitely aligned higher rank graphs (which are, in fact, a class of cancellative monoids). Inverse semigroups form the intermediary…

A vertex k-ranking is a labeling of the vertices of a graph with integers from 1 to k so any path connecting two vertices with the same label will pass through a vertex with a greater label. The rank number of a graph is defined to be the…

In recent years the theory of dendroidal sets has emerged as an important framework for higher algebra. In this article we introduce the concept of a $C^*$-algebraic drawing of a dendroidal set. It depicts a dendroidal set as an object in…

Here we give an overview on the connection between wavelet theory and representation theory for graph $C^{\ast}$-algebras, including the higher-rank graph $C^*$-algebras of A. Kumjian and D. Pask. Many authors have studied different aspects…

In an earlier paper, the authors introduced partial translation algebras as a generalisation of group C*-algebras. Here we establish an extension of partial translation algebras, which may be viewed as an excision theorem in this context.…

In this paper, a classification is given of real rank zero $C^*$-algebras that can be expressed as inductive limits of a sequence of a subclass of Elliott-Thomsen algebras $\mathcal{C}$.

We describe a class of $C^*$-algebras which simultaneously generalise the ultragraph algebras of Tomforde and the shift space $C^*$-algebras of Matsumoto. In doing so we shed some new light on the different $C^*$-algebras that may be…

The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…

For a global field K and an elliptic curve E_eta over K(T), Silverman's specialization theorem implies that rank(E_eta(K(T))) <= rank(E_t(K)) for all but finitely many t in P^1(K). If this inequality is strict for all but finitely many t,…

Many interesting examples of operator algebras, both self-adjoint and non-self-adjoint, can be constructed from directed graphs. In this survey, we overview the construction of $C^*$-algebras from directed graphs and from two…

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…

We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…

In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…

For Leavitt path algebras, we show that whereas removing sources from a graph produces a Morita equivalence, removing sinks gives rise to a recollement situation. In general, we show that for a graph $E$ and a finite hereditary subset $H$…

We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid and category emedding results. We show that they are planar…

We formalize eight different notions of isomorphism among (unital) graph C*-algebras, and initiate the study of which of these notions may be described geometrically as generated by moves. We propose a list of seven types of moves that we…

We introduce a notion of real rank zero for inclusions of C$^*$-algebras. After showing that our definition has many equivalent characterisations, we offer a complete description of the commutative case. We provide permanence and…

We elaborate on the construction of the Evans chain complex for higher-rank graph $C^*$-algebras. Specifically, we introduce a block matrix presentation of the differential maps. These block matrices are then used to identify a wide family…