Related papers: Graphs, spectral triples and Dirac zeta functions
We introduce a new model for investigating spectral properties of quantum graphs, a quantum circulant graph. Circulant graphs are the Cayley graphs of cyclic groups. Quantum circulant graphs with standard vertex conditions maintain…
Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime…
We introduce a zeta function of digraphs that determines, and is determined by, the spectra of all linear combinations of the adjacency matrix, its transpose, the out-degree matrix, and the in-degree matrix. In particular, zeta-equivalence…
In various contexts, the zeta function of an object splits into a product of $L$-functions. We categorify this product formula for quadratic covers of objects in the following contexts: quadratic extensions of number fields, ramified double…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
Let $\mathbf{G}$ be a unipotent group scheme defined in terms of a nilpotent Lie lattice over the ring $\mathcal{O}$ of integers of a number field. We consider bivariate zeta functions of groups of the form $\mathbf{G}(\mathcal{O})$…
We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…
We introduce a generalized Grover matrix of a graph and present an explicit formula for its characteristic polynomial. As a corollary, we give the spectra for the generalized Grover matrix of a regular graph. Next, we define a zeta function…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
To a compact hyperbolic Riemann surface, we associate a finitely summable spectral triple whose underlying topological space is the limit set of a corresponding Schottky group, and whose ``Riemannian'' aspect (Hilbert space and Dirac…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
We define, answering a question of Sarnak in his letter to Bombieri, a symplectic pairing on the spectral interpretation (due to Connes and Meyer) of the zeroes of Riemann's zeta function. This pairing gives a purely spectral formulation of…
If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…
The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where N is the semiring of finite simple graphs and where Z and Q are integral domains, culminating in a Banach algebra R. A single network completes to the Wiener algebra.…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We give an elementary combinatorial proof of Bass's determinant formula for the zeta function of a finite regular graph. This is done by expressing the number of non-backtracking cycles of a given length in terms of Chebychev polynomials in…
We develop a graph-Hilbert-space framework, inspired by non-commutative geometry, on (infinite) graphs and use it to study spectral properies of \tit{graph-Laplacians} and so-called \tit{graph-Dirac-operators}. Putting the various pieces…
It is known that the spin structure on a Riemannian manifold can be extended to noncommutative geometry using the notion of a spectral triple. For finite geometries, the corresponding finite spectral triples are completely described in…
Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of…
We describe the construction of theta summable and finitely summable spectral triples associated to Mumford curves and some classes of higher dimensional buildings. The finitely summable case is constructed by considering the stabilization…