Related papers: A Hoffman's Theorem: a revisit with new discovery

Let $\Gamma$ be an arbitrary $\mathbb{Z}^n$-periodic metric graph, which does not coincide with a line. We consider the Hamiltonian $\mathcal{H}_\varepsilon$ on $\Gamma$ with the action $-\varepsilon^{-1}{\mathrm{d}^2/\mathrm{d} x^2}$ on…

This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…

In 1960, Hoffman and Singleton \cite{HS60} solved a celebrated equation for square matrices of order $n$, which can be written as $$ (\kappa - 1) I_n + J_n - A A^{\rm T} = A$$ where $I_n$, $J_n$, and $A$ are the identity matrix, the all one…

Let G be a simple undirected connected graph. In this paper, new upper bounds on the distance Laplacian spectral radius of G are obtained. Moreover, new lower and upper bounds for the distance signless Laplacian spectral radius of G are…

In this paper, we show that a connected graph with smallest eigenvalue at least -3 and large enough minimal degree is 2-integrable. This result generalizes a 1977 result of Hoffman for connected graphs with smallest eigenvalue at least -2.

The Lagrange and Markov spectra are classical objects in Number Theory related to certain Diophantine approximation problems. Geometrically, they are the spectra of heights of geodesics in the modular surface. These objects were first…

The study of the cone of submodular functions goes back to Jack Edmonds' seminal 1970 paper, which already highlighted the difficulty of characterizing its extreme rays. Since then, researchers from diverse fields have sought to…

Let $\Gamma$ denote a finite (strongly) connected regular (di)graph with adjacency matrix $A$. The {\em Hoffman polynomial} $h(t)$ of $\Gamma=\Gamma(A)$ is the unique polynomial of smallest degree satisfying $h(A)=J$, where $J$ denotes the…

This paper is devoted to the asymptotic analysis of a fractional version of the Ginzburg-Landau equation in bounded domains, where the Laplacian is replaced by an integro-differential operator related to the square root Laplacian as defined…

We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…

We investigate traces of powers of random matrices whose distributions are invariant under rotations (with respect to the Hilbert--Schmidt inner product) within a real-linear subspace of the space of $n\times n$ matrices. The matrices we…

In a previous paper we completely described cyclotomic matrices--integer symmetric matrices of spectral radius at most 2. In this paper we find all minimal noncyclotomic matrices. As a consequence, we are able to determine all integer…

We show that Hoffman's sum of eigenvalues bound for the chromatic number is at least as good as the Lov\'asz theta number, but no better than the ceiling of the fractional chromatic number. In order to do so, we display an interesting…

In this paper, we study the entries of the principal eigenvector of the signless Laplacian matrix of a hypergraph. More precisely, we obtain bounds for this entries. These bounds are computed trough other important parameters, such as…

In this short note we first extend the validity of the spectral radius formula obtained in \cite{ag} to Fourier--Stieltjes algebras. The second part is devoted to showing that for the measure algebra on any locally compact non-discrete…

In this note we correct the proof of Proposition 4 in our paper "The Laplacian Spectrum of Large Graphs Sampled from Graphons" (arXiv:2004.09177) and we improve several results therein. To this end, we prove a new concentration lemma about…

We study the spectral norm of matrices M that can be factored as M=BA, where A is a random matrix with independent mean zero entries, and B is a fixed matrix. Under the (4+epsilon)-th moment assumption on the entries of A, we show that the…

We study the spectral norm of random lifts of matrices. Given an $n\times n$ symmetric matrix $A$, and a centered distribution $\pi$ on $k\times k\ (k\ge 2)$ symmetric matrices with spectral norm at most $1$, let the matrix random lift…

We study quantum versions of the Shannon capacity of graphs and non-commutative graphs. We introduce the asymptotic spectrum of graphs with respect to quantum and entanglement-assisted homomorphisms, and we introduce the asymptotic spectrum…

The well known Mantel's Theorem states that a graph on $n$ vertices and $m$ edges contains a triangle if $m>\frac{n^2}{4}$. Nosal proved that every graph on $m$ edges contains a triangle if the spectral radius $\lambda_1>\sqrt{m}$, which is…