Related papers: Graphs, spectral triples and Dirac zeta functions

In this note, we present a new way to associate a spectral triple to the noncommutative $C^*$-algebra $C^*(\Lambda)$ of a strongly connected finite higher-rank graph $\Lambda$. We generalize a spectral triple of Consani and Marcolli from…

Let $g$ be a bounded symmetric measurable nonnegative function on $[0,1]^2$, and $\left\lVert g \right\rVert = \int_{[0,1]^2} g(x,y) dx dy$. For a graph $G$ with vertices $\{v_1,v_2,\ldots,v_n\}$ and edge set $E(G)$, we define \[ t(G,g) \;…

Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.

We give a geometrical construction of Connes spectral triples or noncommutative Dirac operators $D$ starting with a bimodule connection on the proposed spinor bundle. The theory is applied to the example of $M_2(\Bbb C)$, and also applies…

The purpose of this article is to apply the concept of the spectral triple, the starting point for the analysis of noncommutative spaces in the sense of A.~Connes, to the case where the algebra $\cA$ contains both bosonic and fermionic…

We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…

Classical differential geometry can be encoded in spectral data, such as Connes' spectral triples, involving supersymmetry algebras. In this paper, we formulate non-commutative geometry in terms of supersymmetric spectral data. This leads…

Given a zero-sum function $\beta : V(G) \rightarrow \mathbb{Z}_3$ with $\sum_{v\in V(G)}\beta(v)=0$, an orientation $D$ of $G$ with $d^+_D(v)-d^-_D(v)= \beta(v)$ in $\mathbb{Z}_3$ for every vertex $v\in V(G)$ is called a…

Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…

Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…

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:…

In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph…

In this paper, we present a new way to associate a finitely summable spectral triple to a higher-rank graph $\Lambda$, via the infinite path space $\Lambda^\infty$ of $\Lambda$. Moreover, we prove that this spectral triple has a close…

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$.…

Let G be a finite group and let cd(G) be the set of all complex irreducible character degrees of G Let \rho(G) be the set of all primes which divide some character degree of G. The prime graph \Delta(G) attached to G is a graph whose vertex…

The inertia of a graph $G$ is defined to be the triplet $In(G) = (p(G), n(G), $ $\eta(G))$, where $p(G)$, $n(G)$ and $\eta(G)$ are the numbers of positive, negative and zero eigenvalues (including multiplicities) of the adjacency matrix…

The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…

Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…

We show that the motivic zeta functions of smooth, geometrically connected curves with no rational points are rational functions. This was previously known only for curves whose smooth projective models have a rational point on each…

Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two…