Related papers: Noncommutative manifolds from graph and $k$-graph …
The $k$-expansion of a graph $G$ is the $k$-uniform hypergraph obtained from $G$ by adding $k-2$ new vertices to every edge. We determine, for all $k > d \geq 1$, asymptotically optimal $d$-degree conditions that ensure the existence of all…
We provide a Cuntz-Pimsner model for graph of groups $C^*$-algebras. This allows us to compute the $K$-theory of a range of examples and show that graph of groups $C^*$-algebras can be realised as Exel-Pardo algebras. We also make a…
This paper gives a sufficient and necessary condition for the existence of an (X, s)-arc-transitive imprimitive graph which is not a multicover of a given quotient graph.
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
We introduce a new spectral sequence for the study of $\mathcal{K}$-manifolds which arises by restricting the spectral sequence of a Riemannian foliation to forms invariant under the flows of $\{\xi_1,...,\xi_s\}$. We use this sequence to…
We customize the existing models for the bounded derived category of gentle algebras to obtain simple graph theoretic tools to analyze indecomposable objects, Auslander-Reiten triangles, and their interaction with the associated homological…
The six nondegeneracy conditions of geometric nature that are satisfied by the only six possibly existing nondegenerate general classes I, II, III-1, III-2, IV-1, IV-2 of 5-dimensional CR manifolds are shown to be readable instantaneously…
We consider all complex projective manifolds X that satisfy at least one of the following three conditions: 1. There exists a pair $(C ,\varphi)$, where $C$ is a compact connected Riemann surface and $\varphi : C\to X$ a holomorphic map,…
We report on some findings concerning Connes' noncommutative distance $d$ on a weighted undirected graph $G$. Our main result is the lower bound $\ell/\Delta(G)\le d$ where $\ell$ is the geodesic distance and $\Delta(G)$ the degree of $G$.…
We construct explicit families of graphs whose eigenvalues are asymptotically distributed according to Wigner's semicircle law; in other words, that are spectrally indistinguishable from random graphs. However, in other respects they are…
We construct a canonical noncommutative spectral triple for every oriented closed Riemannian manifold, which represents the fundamental class in the twisted K-homology of the manifold. This so-called "projective spectral triple" is Morita…
Let $K$ be the K3 manifold. In this note, we discuss two methods to prove that certain generalized Miller--Morita--Mumford classes for smooth bundles with fiber $K$ are non-zero. As a consequence, we fill a gap in a paper of the first…
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…
A simple topological graph is $k$-quasiplanar ($k\geq 2$) if it contains no $k$ pairwise crossing edges, and $k$-planar if no edge is crossed more than $k$ times. In this paper, we explore the relationship between $k$-planarity and…
We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…
We study cospectral vertices on finite graphs in relation to the echolocation problem on Riemannian manifolds. First, We prove a computationally simple criterion to determine whether two vertices are cospectral. Then, we use this criterion…
The notion of good spectral triple is initiated. We prove firstly that any regular spectral triple may be embedded in a good spectral triple, so that, in non-commutative geometry, we can restricts to deal only with good spectral triples.…
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 set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…
A graph $G$ on $n$ vertices with $k$ edges is $t$-edge-balanced if every graph on $n$ vertices with $t$ edges is contained in exactly the same number of subgraphs of $K_n$ isomorphic to $G$. Despite the existence of infinite families of…