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

We use spectral invariants in Lagrangian Floer theory in order to show that there exist \emph{isometric} embeddings of normed linear spaces (finite or infinite dimensional, depending on the case) into the space of Hamiltonian deformations…

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $\lceil n/2 \rceil$ is Hamiltonian. In this paper we extend this result to random graphs. Motivated by the study of resilience of…

Barry Simon conjectured in 2005 that the Szeg\H{o} matrices, associated with Verblunsky coefficients $\{\alpha_n\}_{n\in\mathbb{Z}_+}$ obeying $\sum_{n = 0}^\infty n^\gamma |\alpha_n|^2 < \infty$ for some $\gamma \in (0,1)$, are bounded for…

In 1986, Brualdi and Solheid firstly proposed the problem of determining the maximum spectral radius of graphs in the set $\mathcal{H}_{n,m}$ consisting of all simple connected graphs with $n$ vertices and $m$ edges, which is a very tough…

We consider a dilute version of the Wigner ensemble of n-dimensional random matrices H such that each row has in average \rho_n non-zero elements. We study asymptotic properties of the spectral norm of H on the scale n^{-2/3} in the limit…

An adapted version of the proof (due to A. Weil) of the well-known de Rham Theorem allows us to compare uniformly the spectrum of the Hodge Laplacian acting on differential forms (on a compact Riemannian manifold) to the spectrum of the…

This paper leverages the use of \emph{Gram iteration} an efficient, deterministic, and differentiable method for computing spectral norm with an upper bound guarantee. Designed for circular convolutional layers, we generalize the use of the…

The Horn inequalities characterise the possible spectra of triples of $n$-by-$n$ Hermitian matrices $A+B=C$. We study integral inequalities that arise as limits of Horn inequalities as $n \to \infty$. These inequalities are parametrised by…

Let $A(G)$ and $D(G)$ be the adjacency and degree matrices of a simple graph $G$ on $n$ vertices, respectively. The \emph{$A_\alpha$-spectral radius} of $G$ is the largest eigenvalue of $A_\alpha (G)=\alpha D(G)+(1-\alpha)A(G)$ for a real…

In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than $-2$ and large enough minimum degree is switching equivalent to a complete graph. This is a signed analogue of a theorem of Hoffman. The…

Let us consider i.i.d. random variables $\{a_k,b_k\}_{k \geq 1}$ defined on a common probability space $(\Omega, \mathcal F, \mathbb P)$, following a symmetric Rademacher distribution and the associated random trigonometric polynomials…

Let $G$ be a graph with minimum degree $\delta$. The spectral radius of $G$, denoted by $\rho(G)$, is the largest eigenvalue of the adjacency matrix of $G$. In this note we mainly prove the following two results. (1) Let $G$ be a graph on…

For two integers $r\geq 2$ and $h\geq 0$, the \emph{$h$-extra $r$-component connectivity} $\kappa^h_r(G)$ of a graph $G$ is defined to be the minimum size of a subset of vertices whose removal disconnects $G$, and there are at least $r$…

Let $\gamma$ be a constant such that $0 < \gamma < 1$, and let $n$ be a sufficiently large integer. Consider a $3$-uniform hypergraph $H$ on $n$ vertices. In 2013, K\"{u}hn, Osthus, and Treglown, along with Khan independently, proved that…

The Mathieu operator {equation*} L(y)=-y"+2a \cos{(2x)}y, \quad a\in \mathbb{C},\;a\neq 0, {equation*} considered with periodic or anti-periodic boundary conditions has, close to $n^2$ for large enough $n$, two periodic (if $n$ is even) or…

The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…

Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…

We generalize classical results in spectral graph theory and linear algebra more broadly, from the case where the underlying matrix is Hermitian to the case where it is non-Hermitian. New admissibility conditions are introduced to replace…

In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+36t$$ for $t=1260r+169…