Related papers: The Polynomial Endomorphisms of Graph Algebras

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…

We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the…

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 classify spectrum-preserving endomorphisms of stable continuous-trace C^*-algebras up to inner automorphism by a surjective multiplicative invariant taking values in finite dimensional vector bundles over the spectrum. Specializing to…

We apply a method inspired by Popa's intertwining-by-bimodules technique to investigate inner conjugacy of MASAs in graph $C^*$-algebras. First we give a new proof of non-inner conjugacy of the diagonal MASA ${\mathcal D}_n$ to its…

The problem of inner vs outer conjugacy of subalgebras of certain graph C*-algebras is investigated. For a large class of finite graphs E, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph…

For a large class of finite graphs $E$, we show that whenever $\alpha$ is a vertex-fixing quasi-free automorphism of the corresponding graph $C^*$-algebra $C^*(E)$ such that $\alpha({\mathcal D}_E) \neq{\mathcal D}_E$, where ${\mathcal…

We survey recent results on endomorphisms and especially on automorphisms of the Cuntz algebras O_n, with a special emphasis on the structure of the Weyl group. We discuss endomorphisms globally preserving the diagonal MASA and their…

We characterise when the Leavitt path algebras over $\mathbb{Z}$ of two arbitrary countable directed graphs are $*$-isomorphic by showing that two Leavitt path algebras over $\mathbb{Z}$ are $*$-isomorphic if and only if the corresponding…

For any countable graph $E$, we investigate the relationship between the Leavitt path algebra $L_{\C}(E)$ and the graph C*-algebra $C^*(E)$. For graphs $E$ and $F$, we examine ring homomorphisms, ring *-homomorphisms, algebra homomorphisms,…

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…

In this paper we propose a graph superalgebra which is the supersymmetric analogue of Leavitt path algebras. We find a basis for these superalgebras and characterize when they have polynomial growth.

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…

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…

In this paper we show that Leavitt path algebras of weighted graphs and Leavitt path algebras of separated graphs are intimately related. We prove that any Leavitt path algebra $L(E,\omega)$ of a row-finite vertex weighted graph…

The graph groupoids of directed graphs are topologically isomorphic if and only if there is a diagonal-preserving ring *-isomorphism between the Leavitt path algebras.

In this paper, we introduce the notion of a dual topological graph of a given topological graph, and show that it defines a C*-algebra isomorphic to the C*-algebra of the given one. Repeating to take a dual, and taking a projective limit,…

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…

An ultragraph gives rise to a labelled graph with some particular properties. In this paper we describe the algebras associated to such labelled graphs as groupoid algebras. More precisely, we show that the known groupoid algebra…