Related papers: Spectral triples and wavelets for higher-rank grap…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

We present a unified representation-theoretic method to compute the Laplace-Beltrami spectrum on homogeneous principal bundles. For this setting, we introduce a multi-parameter family of metric deformations called generalized canonical…

We consider the problem of designing spectral graph filters for the construction of dictionaries of atoms that can be used to efficiently represent signals residing on weighted graphs. While the filters used in previous spectral graph…

We consider the frame-like formulation of reducible sets of totally symmetric bosonic and fermionic higher-spin fields in flat and AdS backgrounds of any dimension, that correspond to so-called higher-spin triplets resulting from the…

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…

Let $(G_\epsilon)_{\epsilon>0}$ be a family of '$\epsilon$-thin' Riemannian manifolds modeled on a finite metric graph $G$, for example, the $\epsilon$-neighborhood of an embedding of $G$ in some Euclidean space with straight edges. We…

In this paper we will extend the product of spectral triples to a product of semifinite spectral triples. We will prove that finite summability and regularity are preserved under taking products. Connes and Marcolli constructed for each…

We study the inverse spectral problem of jointly recovering a radially symmetric Riemannian metric and an additional coefficient from the Dirichlet spectrum of a perturbed Laplace-Beltrami operator on a bounded domain. Specifically, we…

There has been much recent interest, initiated by work of the physicists Hatano and Nelson, in the eigenvalues of certain random non-Hermitian periodic tridiagonal matrices and their bidiagonal limits. These eigenvalues cluster along a…

We consider Laplacians on periodic metric graphs with unit-length edges. The spectrum of these operators consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite…

We construct spectral triples associated to Schottky--Mumford curves, in such a way that the local Euler factor can be recovered from the zeta functions of such spectral triples. We propose a way of extending this construction to the case…

The Kumjian-Pask algebra of a higher-rank graph generalises the Leavitt path algebra of a directed graph. We extend the definition of Kumjian-Pask algebra to row-finite higher-rank graphs $\Lambda$ with sources which satisfy a…

We study the spectral determinant of the Laplacian on finite graphs characterized by their number of vertices V and of bonds B. We present a path integral derivation which leads to two equivalent expressions of the spectral determinant of…

We propose the spectral degree exponent as a novel graph metric. Although Hofmeister \cite{HofmeisterThesis} has studied the same metric, we generalise Hofmeister's work to weighted graphs. We provide efficient iterative formulas and bounds…

Using Cayley graphs and Clifford algebras, we are able to give, for every finitely generated groups, a uniform construction of spectral triples with a generically non-trivial phase for the Dirac operator. Unfortunatly $D_{+}$ is index $0$,…

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 give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…

We compute the spectra of the adjacency matrices of the semi-regular polytopes. A few different techniques are employed: the most sophisticated, which relates the 1-skeleton of the polytope to a Cayley graph, is based on methods akin to…

For each K-homolgy element of the Sierpinski gasket we construct a spectral triple which will generate that element. We show that there must be certain limits on the choice of the K-homology element if the geometric properties of the gasket…