Related papers: Characterizing graph C*-correspondences
It is easy to see that every character (i.e. unital *-homomorphism to the complex numbers) of a commutative unital associative *-algebra is a pure state (i.e. extreme point in the convex set of all normalized positive linear functionals).…
We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…
We analyze the sequence obtained by consecutive applications of the Cantor-Bendixson derivative for a noncommutative scattered $C^*$-algebra $\mathcal A$, using the ideal $\mathcal I^{At}(\mathcal A)$ generated by the minimal projections of…
Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…
We study graph $C^*$-algebras equipped with generalised gauge actions, and characterise in terms of groupoids and groupoid cocycles when two graph $C^*$-algebras are isomorphic by a diagonal-preserving isomorphism that intertwines the…
We introduce and characterize a particularly tractable class of unital type 1 C*-algebras with bounded dimension of irreducible representations. Algebras in this class are called recursive subhomogeneous algebras, and they have an inductive…
We give a new very concrete description of the C*-envelope of the tensor algebra associated to multivariable dynamical system. In the surjective case, this C*-envelope is described as a crossed product by an endomorphism, and as a groupoid…
Topological quivers are generalizations of directed graphs in which the sets of vertices and edges are locally compact Hausdorff spaces. Associated to such a topological quiver Q is a C*-correspondence, and from this correspondence one may…
In this paper we study the structure of the $C^*$-algebra, generated by the representation of the paths semigroup on a partially ordered set (poset) and get the net of isomorphic $C^*$-algebras over this poset. We construct the extensions…
We consider the functor C that to a unital C*-algebra A assigns the partial order set C(A) of its commutative C*-subalgebras ordered by inclusion. We investigate how some C*-algebraic properties translate under the action of C to…
We define an admissible decomposition of a graph $E$ into subgraphs $F_1$ and $F_2$, and consider the intersection graph $F_1\cap F_2$ as a subgraph of both $F_1$ and $F_2$. We prove that, if the graph $E$ is row finite and its…
Switching is an operation on a graph that does not change the spectrum of the adjacency matrix, thus producing cospectral graphs. An important activity in the field of spectral graph theory is the characterization of graphs by their…
We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite…
We study $C^*$-algebras arising from $C^*$-correspondences, which was introduced by the author. We prove the gauge-invariant uniqueness theorem, and obtain conditions for our $C^*$-algebras to be nuclear, exact, or satisfy the Universal…
We give examples of pairs of isotopic algebras with non-isomorphic congruence lattices. This answers the question of whether all isotopic algebras have isomorphic congruence lattices.
A finite hypergraph $H$ consists of a finite set of vertices $V(H)$ and a collection of subsets $E(H) \subseteq 2^{V(H)}$ which we consider as partition of unity relations between projection operators. These partition of unity relations…
Given an arbitrary countable ordinal $\alpha $, we introduce the notion of type $I_{\alpha }$ C*-algebra and $\alpha $-subhomogeneous C*-algebra. When $\alpha =0$, these recover the notions of Fell C*-algebra and of commutative C*-algebra,…
We introduce P-graphs, which are generalisations of directed graphs in which paths have a degree in a semigroup P rather than a length in N. We focus on semigroups P arising as part of a quasi-lattice ordered group (G,P) in the sense of…
We use non-symmetric distances to give a self-contained account of C*-algebra filters and their corresponding compact projections, simultaneously simplifying and extending their general theory.
A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…