Related papers: Periodic higher rank graphs revisited

We give a combinatorial description of a family of 2-graphs which subsumes those described by Pask, Raeburn and Weaver. Each 2-graph $\Lambda$ we consider has an associated $C^*$-algebra, denoted $C^*(\Lambda)$, which is simple and purely…

Let $\Lambda = \mathbb{Z}^n$ with lexicographic ordering. $\Lambda$ is a totally ordered group. Let $X = \Lambda^+ * \Lambda^+$. Then $X$ is a $\Lambda$-tree. Analogous to the construction of graph $C^*$-algebras, we form a groupoid whose…

For each odd integer $n \geq 3$, we construct a rank-3 graph $\Lambda_n$ with involution $\gamma_n$ whose real C*-algebra $C^*_\mathbb{R}(\Lambda_n, \gamma_n)$ is stably isomorphic to the exotic Cuntz algebra $\mathcal E_n^\mathbb{R}$. This…

A well-known result of Brylawski constructs an elementary lift of a matroid $M$ from a linear class of circuits of $M$. We generalize this result by showing how to construct a rank-$k$ lift of $M$ from a rank-$k$ matroid on the set of…

We define an admissible decomposition of a graph $E$ into subgraphs $F_1$ and $F_2$, and consider the intersection graph $F_1\cap F_2$ as a subgraph of both $F_1$ and $F_2$. We prove that, if the graph $E$ is row finite and its…

In this paper, we discuss a method of constructing separable representations of the $C^*$-algebras associated to strongly connected row-finite $k$-graphs $\Lambda$. We begin by giving an alternative characterization of the…

An automorphism $\beta$ of a $k$-graph $\Lambda$ induces a crossed product $C^* ( \Lambda ) \rtimes_\beta \mathbb{Z}$ which is isomorphic to a $(k+1)$-graph algebra $C^* ( \Lambda \times_\beta \mathbb{Z})$. In this paper we show how this…

A {\em solvable} cover of a graph is a regular cover whose covering transformation group is solvable. In this paper, we show that a solvable cover of a graph can be decomposed into layers of abelian covers, and also, a lift of a given…

We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph $\Lambda$, its cubical (co-)homology and categorical (co-)homology groups are isomorphic in all degrees, thus answering a question of Kumjian,…

The second author showed how Katsura's construction of the C*-algebra of a topological graph E may be twisted by a Hermitian line bundle L over the edge space E. The correspondence defining the algebra is obtained as the completion of the…

Results of Fowler and Sims show that every k-graph is completely determined by its k-coloured skeleton and collection of commuting squares. Here we give an explicit description of the k-graph associated to a given skeleton and collection of…

We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an…

Given a row-finite, source-free, graph of rank k, we extend the definition of reduction introduced by Eckhardt et al. This constitutes a large step forward in the extension of the geometric classification of finite directed graph…

In this monograph we undertake a comprehensive study of separable representations (as well as their unitary equivalence classes) of $C^*$-algebras associated to strongly connected finite $k$-graphs $\Lambda$. We begin with the…

Unanticipated connections between different fragments of lambda calculus and different families of embedded graphs (a.k.a. "maps") motivate the problem of enumerating $\beta$-normal linear lambda terms. In this brief note, it is shown (by…

A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…

We introduce a family of $C^*$-correspondences $X_\alpha$ naturally associated to every ordinal graph $\Lambda$. When $\Lambda$ is a directed graph, $X_0$ is isomorphic to the usual $C^*$-correspondence associated to a graph. We show that…

The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…

Let $\ell$ be a rational prime and let $p:Y\rightarrow X$ be a Galois cover of finite graphs whose Galois group is a finite $\ell$-group. Consider a $\mathbb{Z}_{\ell}$-tower above $X$ and its pullback along $p$. Assuming that all the…

This paper lays out the foundations of graded $K$-theory for Leavitt algebras associated with higher-rank graphs, also known as Kumjian-Pask algebras, establishing it as a potential tool for their classification. For a row-finite $k$-graph…