Related papers: AF-Embeddings of Graph Algebras

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

We continue the study of the effective content of $K$-theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to compute a representation of the algebra as an inductive…

Let G be a finite planar connected graph without loops or multiple edges. All minimal circuits except atmost one - say C* - are triangles. Let k be the number of vertices of C*. There are at least 2**(k-3) colorings of the vertices of G…

Planar Embedding is a drawing of a graph on the plane such that the edges do not intersect each other except at the vertices. We know that testing the planarity of a graph and computing its embedding (if it exists), can efficiently be…

It is known that, if we take a countable model of Zermelo--Fraenkel set theory ZFC and "undirect" the membership relation (that is, make a graph by joining $x$ to $y$ if either $x\in y$ or $y\in x$), we obtain the Erd\H{o}s--R\'enyi random…

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…

Suppose $A$ is a separable unital $C(X)$-algebra each fibre of which is isomorphic to the same strongly self-absorbing and $K_{1}$-injective $C^{*}$-algebra $D$. We show that $A$ and $C(X) \otimes D$ are isomorphic as $C(X)$-algebras…

We characterize when there exists a diagonal preserving $*$-isomorphism between two graph $C^*$-algebras in terms of the dynamics of the boundary path spaces. In particular, we refine the notion of "orbit equivalence" between the boundary…

Let E be an arbitrary directed graph with no restrictions on the number of vertices and edges and let K be any field. We give necessary and sufficient conditions for the Leavitt path algebra L_K(E) to be of countable irreducible…

The Induced Graph Matching problem asks to find k disjoint induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes the classical…

In this paper we verify that the graph forms a complete invariant for Banach algebra isomorphisms of tensor algebras of graphs. For tensor algebras associated with countable directed graphs having no sinks the graph forms an invariant for…

Let A be a unital separable simple infinite-dimensional nuclear C*-algebra with at least one tracial state. We prove that if the trace space of A has compact finite-dimensional extreme boundary then there exist unital embeddings of matrix…

A class of graphs is $\chi$-bounded if there is a function $f$ such that $\chi(G)\le f(\omega(G))$ for every induced subgraph $G$ of every graph in the class, where $\chi,\omega$ denote the chromatic number and clique number of $G$…

A finite unary algebra $(A,F)$ has only countably many countable subdirect powers if and only if every operation $f\in F$ is either a permutation or a constant mapping.

We prove that any separable exact C*-algebra is isomorphic to a subalgebra of the Cuntz algebra ${\cal O}_2.$ We further prove that if $A$ is a simple separable unital nuclear C*-algebra, then ${\cal O}_2 \otimes A \cong {\cal O}_2,$ and…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Graph C*-algebras have been celebrated as C*-algebras that can be seen, because many important properties may be determined by looking at the underlying graph. This paper introduces the permutation graph for a permutative endomorphism of a…

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…

We prove that every AF-algebra is isomorphic to a crossed product of a commutative AF-algebra by a partial automorphism. The case of UHF-algebras is treated in detail.