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

In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…

Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem. All lower bounds so far have made strong restrictions on the computational model.…

The classical problem of characterizing the graphs with bounded eigenvalues may date back to the work of Smith in 1970. Especially, the research on graphs with smallest eigenvalues not less than $-2$ has attracted widespread attention.…

We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…

Developed in 1999 by Akemann, Anderson, and Weaver, the spectral scale of an $n\times n$ matrix $A$, is a convex, compact subset of $\mathbb{R}^3$ that reveals important spectral information about $A$ \cite{AAW}. In this paper we present…

A Poincar\'e-Hopf Theorem for line fields with point singularities on orientable surfaces can be found Hopf's 1956 Lecture Notes on Differential Geometry. In 1955 Markus presented such a theorem in all dimensions, but Markus' statement only…

A Steinhaus random multiplicative function $f$ is a completely multiplicative function obtained by setting its values on primes $f(p)$ to be independent random variables distributed uniformly on the unit circle. Recent work of Harper shows…

This paper establishes a variant of Stewart's theorem (Theorem~6.4 of Stewart, {\em SIAM Rev.}, 15:727--764, 1973) for the singular subspaces associated with the SVD of a matrix subject to perturbations. Stewart's original version uses both…

A coupling method and an analytic one allow us to prove new lower bounds for the spectral gap of reversible diffusions on compact manifolds. Those bounds are based on the a notion of curvature of the diffusion, like the coarse Ricci…

This article presents an extended algorithm for computing the lower spectral radius of finite, non-negative matrix sets. Given a set of matrices $\mathcal{F} = \{A_1, \ldots, A_m\}$, the lower spectral radius represents the minimal growth…

In 2001 Heinrich, Novak, Wasilkowski and Wo\'zniakowski proved that the inverse of the star discrepancy satisfies $n(d,\varepsilon)\leq c_{\abs}d \varepsilon^{-2}$ by showing that there exists a set of points in $[0,1)^d$ whose…

Let ${\bf A} \in R^{n \times n}$ be a nonnegative irreducible square matrix and let $r({\bf A})$ be its spectral radius and Perron-Frobenius eigenvalue. Levinger asserted and several have proven that $r(t):=r((1{-}t) {\bf A} + t {\bf…

It is well known that a fixed point iteration for solving a linear equation system converges if and only if the spectral radius of the iteration matrix is less than one. A method is presented which guarantees the Fixed Point, even if this…

Let $\sigma(A)$, $\rho(A)$ and $r(A)$ denote the spectrum, spectral radius and numerical radius of a bounded linear operator $A$ on a Hilbert space $H$, respectively. We show that a linear operator $A$ satisfying $$\rho(AB)\le r(A)r(B)…

Let $F_{a_1,\dots,a_k}$ be a graph consisting of $k$ cycles of odd length $2a_1+1,\dots, 2a_k+1$, respectively which intersect in exactly a common vertex, where $k\geq1$ and $a_1\ge a_2\ge \cdots\ge a_k\ge 1$. In this paper, we present a…

The $k$-th Laplacian spectral moment of a digraph $G$ is defined as $\sum_{i=1}^n \lambda_i^k$, where $\lambda_i$ are the eigenvalues of the Laplacian matrix of $G$ and $k$ is a nonnegative integer. For $k=2$, this invariant is better known…

Let $G$ be a simple graph, and denote by $\lambda(G)$ its spectral radius. Sun and Das (2020) established that for any non-isolated vertex $v$ with degree $d(v)$, \[ \lambda(G)\leq \sqrt{\lambda(G-v)^2 + 2d(v) - 1}, \] which is a conjecture…

In this paper, we consider real and complex algebras as well as algebras over general fields. In Section 2, we revisit and prove several results on (quadratic) algebras over general fields. As an example, we demonstrate that a quadratic…

In 1976 Faudree and Schelp conjectured that in a hamiltonian-connected graph on $n$ vertices, any two distinct vertices are connected by a path of length $k$ for every $k \ge n/2$. In 1978 Thomassen constructed a (non-cubic and non-planar)…

Let $A=\begin{bmatrix} A_{ij} \end{bmatrix}$ be an $n\times n$ operator matrix, where each $A_{ij}$ is a bounded linear operator on a complex Hilbert space. Among other numerical radius bounds, we show that $w(A)\leq w(\hat{A})$, where…