相关论文: A Hoffman's Theorem: a revisit with new discovery

Let $\mathcal{H}=(V, E)$ be an $r$-uniform hypergraph on $n$ vertices. The signless Laplacian spectral radius of $\mathcal{H}$ is defined as the maximum modulus of the eigenvalues of the tensor…

The $A_\alpha$-matrix of a digraph $D$ is defined as a linear convex combination $\alpha\operatorname{Deg}(D)+(1-\alpha)A(D)$ of the adjacency matrix $A(D)$ and the diagonal out-degree matrix $\operatorname{Deg}(D)$, where $\alpha\in[0,1]$.…

Let $(M,\omega)$ be a symplectic manifold compact or convex at infinity. Consider a closed Lagrangian submanifold $L$ such that $\omega |_{\pi_2(M,L)}=0$ and $\mu|_{\pi_2(M,L)}=0$, where $\mu$ is the Maslov index. Given any Lagrangian…

In studying the complex H\'enon maps, Mummert (in "Holomorphic shadowing for H\'enon maps" Nonlinearity 21 pp. 2887-2898, 2008) defined an operator the fixed points of which give rise to bounded orbits. This enabled him to obtain an…

We obtain nonasymptotic bounds on the spectral norm of random matrices with independent entries that improve significantly on earlier results. If $X$ is the $n\times n$ symmetric matrix with $X_{ij}\sim N(0,b_{ij}^2)$, we show that…

We consider the set $A_{n}=\displaystyle\cup_{j=0}^{\infty}\{\varepsilon_{j}(n)\cdot n^j\colon\varepsilon_{j}(n)\in\{0,\pm1,\pm2,...,\pm\lfloor{{n}/{2}}\rfloor\}\} $. Let $\mathcal{S}_{\mathcal{A}}= \bigcup_{a \in\mathcal{A} } A_{a}$ where…

We investigate forms of the Hopf invariant one problem in motivic homotopy theory over arbitrary base fields of characteristic not equal to $2$. Maps of Hopf invariant one classically arise from unital products on spheres, and one…

In 1992, Szyld provided a sequence of lower bounds for the spectral radius of a nonnegative matrix $A$, based on the geometric symmetrization of powers of $A$. In 1998, Ta\c{s}\c{c}i and Kirkland proved a companion result by giving a…

We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…

We introduce the asymptotic spectrum of graphs and apply the theory of asymptotic spectra of Strassen (J. Reine Angew. Math. 1988) to obtain a new dual characterisation of the Shannon capacity of graphs. Elements in the asymptotic spectrum…

The chain complexes underlying Floer homology theories typically carry a real-valued filtration, allowing one to associate to each Floer homology class a spectral number defined as the infimum of the filtration levels of chains representing…

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let $\mathcal{F}(\lambda)$ be the family of connected graphs of spectral radius $\le \lambda$. We show that $\mathcal{F}(\lambda)$ can be defined by a finite…

In this paper, it is shown that with large probability, the spectral radius of a large non-Hermitian random matrix with a general variance profile does not exceed the square root of the spectral radius of the variance profile matrix. A…

A famous result going back to Eric Kostlan states that the moduli of the eigenvalues of random normal matrices with radial potential are independent yet non identically distributed. This phenomenon is at the heart of the asymptotic analysis…

Let $M\subset \mathbb{S}^{n+1}\subset\mathbb{R}^{n+2}$ be a compact cmc rotational hypersurface of the $(n+1)$-dimensional Euclidean unit sphere. Denote by $|A|^2$ the square of the norm of the second fundamental form and $J(f)=-\Delta…

We consider $n\times n$ real symmetric and hermitian random matrices $H_{n,m}$ equals the sum of a non-random matrix $H_{n}^{(0)}$ matrix and the sum of $m$ rank-one matrices determined by $m$ i.i.d. isotropic random vectors with…

A new geometric proof of the spectral theorem for unbounded self-adjoint operators A in a Hilbert space H is given based on a splitting of A in positive and negative parts A+ and A-. For both operators A+ and A- the spectral family can be…

We investigate spectral lower bounds on the chromatic number $\chi$ of Hamming graph powers $H(n, q)^p$, Johnson graph powers $J(n, k)^p$, and Kneser graph powers $K(n, k)^p$ providing the first computationally feasible nontrivial results.…

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 $L$ and $M$ denote the Lagrange and Markov spectra, respectively. It is known that $L\subset M$ and that $M\setminus L\neq\varnothing$. In this work, we exhibit new gaps of $L$ and $M$ using two methods. First, we derive such gaps by…