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

The Stein-Tomas restriction theorem on Euclidean space says one can meaningfully restrict $\hat{f}$ to the unit sphere of $\mathbb{R}^n$ provided $f \in L^p(\mathbb{R}^n)$ with $1 < p < 2$. This result can be rewritten in terms of the…

A harmonic mapping $f=h+\overline{g}$ in $\mathbb{D}$ is $\varphi$-normal if $f^{\#}(z)=\mathcal{O}(|\varphi(z)|), \text{ as } |z|\to 1^-,$ where $f^{\#}(z)={(|h'(z)|+|g'(z)|)}/{(1+|f(z)|^2)}.$ In this paper, we establish several sufficient…

In this paper, we shed new light on the spectrum of the relation algebra we call $A_{n}$, which is obtained by splitting the non-flexible diversity atom of $6_{7}$ into $n$ symmetric atoms. Precisely, we show that the minimum value in…

In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the $2$-clique extension of the $(t+1)\times(t+1)$-grid is determined by its spectrum when $t$ is large…

We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…

Let $\chi(G)$ denote the chromatic number of a graph and $\chi_v(G)$ denote the vector chromatic number. For all graphs $\chi_v(G) \le \chi(G)$ and for some graphs $\chi_v(G) \ll \chi(G)$. Galtman proved that Hoffman's well-known lower…

The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set $A$ of positive numbers, one can find asymptotic lower bounds for $\max\{|A+A|,|A\cdot A|\}$ of the order of $|A|^{1+\delta}$ for every $\delta <1$. In…

Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph…

We introduce a new technique to prove bounds for the spectral radius of a random matrix, based on using Jensen's formula to establish the zerofreeness of the associated characteristic polynomial in a region of the complex plane. Our…

The classic graphical Cheeger inequalities state that if $M$ is an $n\times n$ symmetric doubly stochastic matrix, then \[ \frac{1-\lambda_{2}(M)}{2}\leq\phi(M)\leq\sqrt{2\cdot(1-\lambda_{2}(M))} \] where…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

A well known upper bound for the spectral radius of a graph, due to Hong, is that $\mu_1^2 \le 2m - n + 1$. It is conjectured that for connected graphs $n - 1 \le s^+ \le 2m - n + 1$, where $s^+$ denotes the sum of the squares of the…

In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result…

In this paper, we apply spectral invariants, constructed in [Oh5,8], to the study of Hamiltonian diffeomorphisms of closed symplectic manifolds $(M,\omega)$. Using spectral invariants, we first construct an invariant norm called the {\it…

Let G be a graph, H be its chromatic number, L be the largest eigenvalue of its Laplacian, and M be the largest eigenvalue of its adjacency matrix. Then, complementing a well-known result of Hoffman, we show that L>=(H/(H-1))M

We study the low energy resolvent of the Hodge Laplacian on a manifold equipped with a fibred boundary metric. We determine the precise asymptotic behavior of the resolvent as a fibred boundary (aka $\phi$-) pseudodifferential operator when…

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…

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 obtain new bounds for the Laplacian spectral radius of a signed graph. Most of these new bounds have a dependence on edge sign, unlike previously known bounds, which only depend on the underlying structure of the graph. We then use some…