Related papers: Flow equivalence of graph algebras
We consider when the universal $C^*$-algebras associated to edge-colored directed graphs are exact. Specifically, for countable edge-colored directed graphs we show that the universal $C^*$-algebra is exact if and only if the $C^*$-algebra…
The theory of Leavitt path algebras is intrinsically related, via graphs, to the theory of symbolic dynamics and $C^*$-algebras where the major classification programs have been a domain of intense research in the last 50 years. In this…
We generalise the Dixmier-Douady classification of continuous-trace C*-algebras to Fell algebras. To do so, we show that C*-diagonals in Fell algebras are precisely abelian subalgebras with the extension property, and use this to prove that…
We use the technology of linking groupoids to show that equivalent groupoids have Morita equivalent reduced C*-algebras. This equivalence is compatible in a natural way in with the Equivalence Theorem for full groupoid C*-algebras.
We provide the rigorous foundations for a categorical approach to the classification of C*-dynamics up to cocycle conjugacy. Given a locally compact group $G$, we consider a category of (twisted) $G$-C*-algebras, where morphisms between two…
This paper investigates the structure of C*-algebras built from one-sided Sturmian subshifts. They are parametrised by irrationals in the unit interval and built from a local homeomorphism associated to the subshift. We provide an explicit…
We introduce a new class of C^*-algebras, which is a generalization of both graph algebras and homeomorphism C^*-algebras. This class is very large and also very tractable. We prove the so-called gauge-invariant uniqueness theorem and the…
Markov matrices of equal-input type constitute a widely used model class. The corresponding equal-input generators span an interesting subalgebra of the real matrices with zero row sums. Here, we summarise some of their amazing properties…
A $\lambda$-graph system $\frak L$ is a labeled Bratteli diagram with shift operation. It is a generalized notion of finite labeled graph and presents a subshifts. We will study continuous orbit equivalence of one-sided subshifts and…
We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at…
Let A be a C*-algebra and d from A into A** be a continuous linear map. We assume that d acts like derivation or anti-derivation at orthogonal elements for several types of orthogonality conditions such as ab=0, ab*=0, ab=ba=0 and…
We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
Conduction graphs are defined here in order to elucidate at a glance the often complicated conduction behaviour of molecular graphs as ballistic molecular conductors. The graph $G^{\mathrm C}$ describes all possible conducting devices…
Higher-rank graphs were introduced by Kumjian and Pask to provide models for higher-rank Cuntz-Krieger algebras. In a previous paper, we constructed 2-graphs whose path spaces are rank-two subshifts of finite type, and showed that this…
We study flows on C*-algebras with the Rokhlin property. We show that every Kirchberg algebra carries a unique Rokhlin flow up to cocycle conjugacy, which confirms a long-standing conjecture of Kishimoto. We moreover present a…
In a number of recent papers, (k+l)-graphs have been constructed from k-graphs by inserting new edges in the last l dimensions. These constructions have been motivated by C*-algebraic considerations, so they have not been treated…
In this paper, we characterize the C*-Algebra generated by partial isometries.
We study generative modeling of graphs with recurring subgraph motifs. We propose Flowette, a continuous flow matching framework that employs a graph neural network-based transformer to learn a velocity field over graph representations with…
We prove that ample groupoids with sigma-compact unit spaces are equivalent if and only if they are stably isomorphic in an appropriate sense, and relate this to Matui's notion of Kakutani equivalence. We use this result to show that…