Related papers: The Spectral Theorem for Bimodules in Higher Rank …

Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…

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…

An $(a,b)$-biregular bipartite graph is a bipartite graph with bipartition $(X, Y)$ such that each vertex in $X$ has degree $a$ and each vertex in $Y$ has degree $b$. By the bipartite expander mixing lemma, biregular bipartite graphs have…

We investigate polynomial endomorphisms of graph $C^*$-algebras and Leavitt path algebras. To this end, we define and analyze the coding graph corresponding to each such an endomorphism. We find an if and only if condition for the…

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…

The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A bipartite graph is distance-biregular when it is…

We study algebraic properties of full rank 1 algebras in a general framework and derive a method to verify if one such matrix polynomial sub-algebra is bispectral. We give two examples illustrating the method. In the first one, we consider…

It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…

Let $\gamma = (\gamma_1,...,\gamma_N)$, $N \geq 2$, be a system of proper contractions on a complete metric space. Then there exists a unique self-similar non-empty compact subset $K$. We consider the union ${\mathcal G} = \cup_{i=1}^N…

Let $A$ be a Banach algebra. By $\sigma(x)$ and $r(x)$ we denote the spectrum and the spectral radius of $x\in A$, respectively. We consider the relationship between elements $a,b\in A$ that satisfy one of the following two conditions: (1)…

We study stable finiteness of extensions of 2-graph C*-algebras determined by saturated hereditary sets of vertices. We use two iterations of the Pimsner-Voiculescu sequence to calculate the map in K-theory induced by the inclusion of a…

Let A be a C*-algebra. It is shown that A is an AW*-algebra if, and only if, each maximal abelian self--adjoint subalgebra of A is monotone complete. An analogous result is proved for Rickart C*-algebras; a C*-algebra is a Rickart…

Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…

In this paper, we first present spectral conditions for the existence of $C_{n-1}$ in graphs (2-connected graphs) of order $n$, which are motivated by a conjecture of Erd\H{o}s. Then we prove spectral conditions for the existence of…

We study the structure and compute the stable rank of C*-algebras of finite higher-rank graphs. We completely determine the stable rank of the C*-algebra when the k-graph either contains no cycle with an entrance, or is cofinal. We also…

In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…

We investigate the question: when is a higher-rank graph C*-algebra approximately finite dimensional? We prove that the absence of an appropriate higher-rank analogue of a cycle is necessary. We show that it is not in general sufficient,…

Higher rank semigraph algebras are introduced by mixing concepts of ultragraph algebras and higher rank graph algebras. This yields a kind of higher rank generalisation of ultragraph algebras. We prove Cuntz--Krieger uniqueness theorems for…

In the 1970s, Feldman and Moore classified separably acting von Neumann algebras containing Cartan MASAs using measured equivalence relations and 2-cocycles on such equivalence relations. In this paper, we give a new classification in terms…

In this paper, two sufficient and necessary conditions are given. The first one characterizes when the boundary path groupoid of a topological graph without singular vertices has closed interior of its isotropy group bundle, and the second…