Related papers: Corners of graph algebras

We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…

In this paper we investigate whether positive elements in the multiplier algebras of certain finite C*-algebras can be written as finite linear combinations of projections with positive coefficients (PCP). Our focus is on the category of…

There are several notions of convergence for sequences of bounded degree graphs. One such notion is left convergence, which is based on counting neighborhood distributions. Another notion is right convergence, based on counting…

It is a well-known fact that endomorphisms of $B(H)$ are intimately connected with families of mutually orthogonal isometries, i.e. with representations of the so-called Toeplitz $C^*$-algebras. In this paper we consider a natural…

We introduce a method to define $C^*$-algebras from $C^*$-correspondences. Our construction generalizes Cuntz-Pimsner algebras, crossed products by Hilbert $C^*$-modules, and graph algebras.

Let $E$ and $F$ be Hilbert $C^*$-modules over a $C^*$-algebra $\CAlg{A}$. New classes of (possibly unbounded) operators $t:E\to F$ are introduced and investigated. Instead of the density of the domain $\Def(t)$ we only assume that $t$ is…

We show for a coring which is finitely generated projective as a left module that the Cartier cohomology is isomorphic to the relative Hochschild cohomology of the right algebra. Furthermore, we show that this isomorphism lifts to the level…

We show that the graph construction used to prove that a gauge-invariant ideal of a graph C*-algebra is isomorphic to a graph C*-algebra, and also used to prove that a graded ideal of a Leavitt path algebra is isomorphic to a Leavitt path…

We prove that the Cuntz-Pimsner algebra O(E) of a vector bundle E over a compact metrizable space X is determined up to an isomorphism of C(X)-algebras by the ideal (1-[E])K(X) of the K-theory ring K(X). Moreover, if E and F are vector…

In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…

We study relative Cohn path algebras, also known as Leavitt-Cohn path algebras, and we realize them as partial skew group rings (to do this we prove uniqueness theorems for relative Cohn path algebras). Furthermore, given any graph $E$ we…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…

The k-th power D^k of a directed graph D is defined to be the directed graph on the vertices of D with an arc from a to b in D^k iff one can get from a to b in D with exactly k steps. This notion is equivalent to the k-fold composition of…

We generalise the theory of Cuntz-Krieger families and graph algebras to the class of finitely aligned $k$-graphs. This class contains in particular all row-finite $k$-graphs. The Cuntz-Krieger relations for non-row-finite $k$-graphs look…

In this paper we analyze the structure of C*-algebras associated to ultragraphs, which are generalizations of directed graphs. We characterize the simple ultragraph algebras as well as deduce necessary and sufficient conditions for an…

The algebra of eikonals $\mathfrak E$ of a metric graph $\Omega$ is an operator $C^*$-algebra determined by dynamical system with boundary control that describes wave propagation on the graph. In this paper, two canonical block forms…

Combining the theory of extensions of C*-algebras and the Pimsner construction, we show that every countable infinite discrete group admits an ergodic action on arbitrary unital Kirchberg algebra. In the proof, we give a Pimsner…

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…