Related papers: Eigenvalue equation for genus two modular graphs

In this work, we prove a general version of the reduction lemmas for eigenfunctions of graphs admitting involutive automorphisms of a special type.

In this note we derive an explicit modular invariant formula for the two loop 4-point amplitude in superstring theory in terms of a multiple integral (7 complex integration variables) over the complex plane which is shown to be convergent.…

We give an algebro-geometric derivation of the known intersection theory on the moduli space of stable rank 2 bundles of odd degree over a smooth curve of genus g. We lift the computation from the moduli space to a Quot scheme, where we…

On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…

In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…

We describe a simple algebraic approach to several spectral duality results for integrable systems and illustrate the method for two types of examples: The Bertola-Eynard-Harnad spectral duality of the two-matrix model as well as the…

The two loop equal mass sunrise graph is considered in the continuous d-dimensional regularisation for arbitrary values of the momentum transfer. After recalling the equivalence of the expansions at d=2 and d=4, the second order…

We propose a topological version of four-dimensional (Euclidean) Einstein gravity, in which anti-self-dual 2-forms and an SU(2) connection are used as fundamental fields. The theory describes the moduli space of conformally self-dual…

In this paper, first we present the variational formulation for a second strain gradient Euler-Bernoulli beam theory for the first time. The governing equation and associated classical and non-classical boundary conditions are obtained.…

Let $G$ be a graph with $n$ vertices and $m$ edges. The energy $E$ of the graph $G$ is defined as the sum of the moduli of the adjacency eigenvalues $\lambda_{1} \geq \lambda_{2} \geq \ldots \geq \lambda_{n}$ of $G$: $$…

Among all simple nonbipartite 2-connected graphs and among all nonbipartite $\theta$-graphs, the minimum least $Q$-eigenvalues are completely determined, respectively.

We prove explicit and sharp eigenvalue estimates for Neumann $p$-Laplace eigenvalues in domains that admit a representation in Fermi coordinates. More precisely, if $\gamma$ denotes a non-closed curve in $\mathbb{R}^2$ symmetric with…

We undertake an extensive numerical investigation of the graph spectra of thousands regular graphs, a set of random Erd\"os-R\'enyi graphs, the two most popular types of complex networks and an evolving genetic network by using novel…

Invariance of Type IIB superstring theory under SL(2,Z) or S-duality implies dependence on the complex coupling T through real and complex modular forms in T. Their structure may be understood explicitly in an expansion of superstring…

Let $m_GI$ denote the number of Laplacian eigenvalues of a graph $G$ in an interval $I$ and let $\alpha(G)$ denote the independence number of $G$. In this paper, we determine the classes of graphs that satisfy the condition…

We present the first steps towards the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to 1 or -1. Here we deal with the disconnected, the bipartite and the complete signed graphs.…

In this paper, we show that the eigenvalues of certain classes of Cayley graphs are integers. The (n,k,r)-arrangement graph A(n,k,r) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are…

Let $G$ be a simple connected graph of order $n$ and $D(G)$ be the distance matrix of $G.$ Suppose that $\lambda_{1}(D(G))\geq\lambda_{2}(D(G))\geq\cdots\geq\lambda_{n}(D(G))$ are the distance spectrum of $G$. A graph $G$ is said to be…

We introduce a new graph polynomial in two variables. This ``interlace'' polynomial can be computed in two very different ways. The first is an expansion analogous to the state space expansion of the Tutte polynomial; the significant…

We determine connected bipartite regular graphs with four distinct adjacency eigenvalues that induce periodic Grover walks, and show that it is only $C_6$. We also show that there are only three kinds of the second largest eigenvalues of…