Related papers: Eikonal algebra on a graph of simple structure
We investigate the pure infiniteness and stable finiteness of the Exel-Pardo $C^*$-algebras $\mathcal{O}_{G,E}$ for countable self-similar graphs $(G,E,\varphi)$. In particular, we associate a specific ordinary graph $\widetilde{E}$ to…
Based on the assumption that time evolves only in one direction and mechanical systems can be described by Lagrangeans, a dynamical C*-algebra is presented for non-relativistic particles at atomic scales. Without presupposing any…
We provide a complete classification of the class of unital graph $C^*$-algebras - prominently containing the full family of Cuntz-Krieger algebras - showing that Morita equivalence in this case is determined by ordered, filtered…
The construction of the Leavitt path algebra associated to a directed graph $E$ is extended to incorporate a family $C$ consisting of partitions of the sets of edges emanating from the vertices of $E$. The new algebras, $L_K(E,C)$, are…
We introduce the notion of orbit equivalence of directed graphs, following Matsumoto's notion of continuous orbit equivalence for topological Markov shifts. We show that two graphs in which every cycle has an exit are orbit equivalent if…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
The graph C*-algebra of a directed graph E is the universal C*-algebra generated by a family of partial isometries satisfying relations which reflect the path structure of E. In the first part of this paper we consider coverings of directed…
We study dynamical systems arising from word maps on simple groups. We develop a geometric method based on the classical trace map for investigating periodic points of such systems. These results lead to a new approach to the search of…
Let $E$ be a finite directed graph with no sources or sinks and write $X_E$ for the graph correspondence. We study the $C^*$-algebra $C^*(E,Z):=\mathcal{T}(X_E,Z)/\mathcal{K}$ where $\mathcal{T}(X_E,Z)$ is the $C^*$-algebra generated by…
K-theory and Ext are computed for the C*-algebra C*(E) of any countable directed graph E. The results generalize the K-theory computations of Raeburn and Szymanski and the Ext computations of Tomforde for row-finite graphs. As a…
We give a concise introduction to (discrete) algebras arising from \'etale groupoids, (aka Steinberg algebras) and describe their close relationship with groupoid C*-algebras. Their connection to partial group rings via inverse semigroups…
In this article a new formulation of the Weyl C*-algebra, which has been invented by Fleischhack, in terms of C*-dynamical systems is presented. The quantum configuration variables are given by the holonomies along paths in a graph.…
We describe two kinds of regular invariant measures on the boundary path space of a second countable topological graph, which allows us to describe all extremal tracial weights on the graph C$^{*}$-algebra which are not gauge-invariant.…
$\Gamma$-conformal algebra is an axiomatic description of the operator product expansion of chiral fields with simple poles at finitely many points. We classify these algebras and their representations in terms of Lie algebras and their…
For any finite graph Gamma and any field K of characteristic unequal to 2 we construct an algebraic variety X over K whose K-points parameterise K-Lie algebras generated by extremal elements, corresponding to the vertices of the graph, with…
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edge set by performing as few queries as possible. An algorithm…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labelled graph $C^*$-algebra by taking a weakly left--resolving labelled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial…
We address the classification problem for graph $C^*$-algebras of finite graphs (finitely many edges and vertices), containing the class of Cuntz-Krieger algebras as a prominent special case. Contrasting earlier work, we do not assume that…
A {\it separated graph} is a pair $(E,C)$ consisting of a directed graph $E$ and a set $C=\bigsqcup_{v\in E^0}C_v$, where each $C_v$ is a partition of the set of edges whose terminal vertex is $v$. Given a separated graph $(E,C)$, such that…