Related papers: A bound on the joint spectral radius using the dia…

Let $G$ be a graph attaining the maximum spectral radius among all connected nonregular graphs of order $n$ with maximum degree $\Delta$. Let $\lambda_1(G)$ be the spectral radius of $G$. A nice conjecture due to Liu, Shen and Wang [On the…

In 1970 Smith classified all connected graphs with the spectral radius at most $2$. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to…

We study Riemannian manifolds $(M^n,g)$ with mean-convex boundary whose Ricci curvature is nonnegative in a spectral sense. Our first main result is a sharp spectral extension of a rigidity theorem by Kasue: we prove that under the…

For a square matrix, the range of its Rayleigh quotients is known as the numerical range, which is a compact and convex set by the Toeplitz-Hausdorff theorem. The largest value and the smallest boundary value (in magnitude) of this convex…

We establish a majorization-based theory for bounding observables of waves with varied coherence. For any measurement, exact bounds are attained by the maximal and minimal elements in the set of input coherence spectra. The set's supremum…

Consider the random matrix $\Sigma = D^{1/2} X \widetilde D^{1/2}$ where $D$ and $\widetilde D$ are deterministic Hermitian nonnegative matrices with respective dimensions $N \times N$ and $n \times n$, and where $X$ is a random matrix with…

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

In this note, we show that the norm of an $n\times n$ random jointly exchangeable matrix with zero diagonal can be estimated in terms of the norm of its $n/2\times n/2$ submatrix located in the top right corner. As a consequence, we prove a…

The maximum of the absolute value of a real homogeneous polynomial of degree $d\ge 3$ on the unit sphere corresponds to the spectral norm of the induced real $d$-symmetric tensor $\mathcal{S}$. We give two sequences of upper bounds on the…

We give a unified and systematic way to find bounds for the largest real eigenvalue of a nonnegative matrix by considering its modified quotient matrix. We leverage this insight to identify the unique class of matrices whose largest real…

Let A(G) be the adjacency tensor (hypermatrix) of uniform hypergraph G. The maximum modulus of the eigenvalues of A(G) is called the spectral radius of G. In this paper, the conjecture of Fan et al. in [5] related to compare the spectral…

A numerical method of solving the problem of acoustic wave radiation in the presence of a rigid scatterer is described. It combines the finite element method and the boundary algebraic equations. In the proposed method, the exterior domain…

Consider an $n\times n$ matrix polynomial $P(\lambda)$ and a set $\Sigma$ consisting of $k \le n$ distinct complex numbers. In this paper, a (weighted) spectral norm distance from $P(\lambda)$ to the matrix polynomials whose spectra include…

In this paper, we introduce the concept of Z$_1$-eigenvalue to infinite dimensional generalized Hilbert tensors (hypermatrix) $\mathcal{H}_\lambda^{\infty}=(\mathcal{H}_{i_{1}i_{2}\cdots i_{m}})$, $$ \mathcal{H}_{i_{1}i_{2}\cdots…

For a $hypergraph$ $\mathcal{G}=(V, E)$ consisting of a nonempty vertex set $V=V(\mathcal{G})$ and an edge set $E=E(\mathcal{G})$, its $adjacency$ $matrix$ $\mathcal {A}_{\mathcal{G}}=[(\mathcal {A}_{\mathcal{G}})_{ij}]$ is defined as…

The research on spectral inequalities for discrete Schrodinger Operators has proved fruitful in the last decade. Indeed, several authors analysed the operator's canonical relation to a tridiagonal Jacobi matrix operator. In this paper, we…

For real $\alpha\in [0,1)$ and a hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest eigenvalue of the matrix $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$, where $A(G)$ is the adjacency matrix of $G$, which is a symmetric…

Let $\mathcal{B}(n,q)$ be the class of block graphs on $n$ vertices having all their blocks of the same size. We prove that if $G\in \mathcal{B}(n,q)$ has at most three pairwise adjacent cut vertices then the minimum spectral radius…

Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix of $G$, respectively. In this paper, we present a sharp upper bound for…

Let $A$ be a nonnegative symmetric $ 5 \times 5 $ matrix with eigenvalues $ \lambda_1 \geq \lambda_2 \geq \lambda_3 \geq \lambda_4 \geq \lambda_5 $. We show that if $ \sum_{i=1}^{5} \lambda_{i} \geq \frac{1}{2} \lambda_1 $ then $ \lambda_3…