Related papers: Eigenvalue equation for the modular graph $C_{a,b,…

An eigenvalue $\lambda$ of a signed graph $S$ of order $n$ is called a main eigenvalue if its eigenspace is not orthogonal to the all-ones vector $j$. Characterizing signed graphs with exactly $k$ $(1\le k\le n)$ distinct main eigenvalues…

Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest…

The coefficients of the higher-derivative terms in the low energy expansion of genus-one graviton Type II superstring scattering amplitudes are determined by integrating sums of non-holomorphic modular functions over the complex structure…

The eccentricity matrix of a connected graph $G$ is obtained from the distance matrix of $G$ by retaining the largest distances in each row and each column, and setting the remaining entries as $0$. In this article, a conjecture about the…

We lay down the foundations of the Eigenvalue Method in coding theory. The method uses modern algebraic graph theory to derive upper bounds on the size of error-correcting codes for various metrics, addressing major open questions in the…

We consider an eigenvalue problem for an inverted one dimensional harmonic oscillator. We find a complete description for the eigenproblem in $C^{\infty}(\mathbb R)$. The eigenfunctions are described in terms of the confluent hypergeometric…

Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for…

The eccentricity matrix of a connected graph $G$, denoted by $\mathcal{E}(G)$, is obtained from the distance matrix of $G$ by keeping the largest nonzero entries in each row and each column, and leaving zeros in the remaining ones. The…

Let $A$ be a fixed complex matrix and let $u,v$ be two vectors. The eigenvalues of matrices $A+\tau uv^\top $ $(\tau\in\mathbb{R})$ form a system of intersecting curves. The dependence of the intersections on the vectors $u,v$ is studied.

Recently, three numerical methods for the computation of eigenvalues of singular matrix pencils, based on a rank-completing perturbation, a rank-projection, or an augmentation were developed. We show that all three approaches can be…

Consider a bound state (an eigenfunction) $\psi$ of an atom with $N$ electrons. We study the spectra of the one-particle density matrix $\gamma$ and of the one-particle kinetic energy density matrix $\tau$ associated with $\psi$. The paper…

The eight-vertex model on the square lattice with vertex weights $a,b,c,d$ obeying the relation $(a^2+ab)(b^2+ab)=(c^2+ab)(d^2+ab)$ is considered. Its transfer matrix with $L=2n+1,\, n\geqslant 0,$ vertical lines and periodic boundary…

We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian…

We consider the scalar integral associated to the 3-loop sunrise graph with a massless line, two massive lines of equal mass $M$, a fourth line of mass equal to $Mx$, and the external invariant timelike and equal to the square of the fourth…

In this paper, we determine the set of all distinct eigenvalues of the line graph which is induced by the first and second layers of the hypercube $ Q_n $, $n>3$. We show that this graph has precisely five distinct eigenvalues and all of…

For an endomorphism $s:V\rightarrow V$ of a finite dimensional complex vector space and an action of a torus $T$ on the full flag variety $\text{GL}_n({\mathbb C})/B$, we give a description of its fixed point set when $s$ is semisimple or…

We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to $-2$, or $0$, and determine which of these graphs are determined by their adjacency spectrum.

Let $G$ be a connected $d$-regular graph of order $n$, where $d\geq3$. Let $\lambda_{2}(G)$ be the second largest eigenvalue of $G$. For even $n$, we show that $G$ contains $\left\lfloor\frac{2}{3}(d-\lambda_{2}(G))\right\rfloor$…

The purpose of this work is to study spectral methods to approximate the eigenvalues of nonlocal integral operators. Indeed, even if the spatial domain is an interval, it is very challenging to obtain closed analytical expressions for the…

We investigate generating functions for the integrals over world-sheet tori appearing in closed-string one-loop amplitudes of bosonic, heterotic and type-II theories. These closed-string integrals are shown to obey homogeneous and linear…