Related papers: A Lichnerowicz-type estimate for Steklov eigenvalu…
We prove some Liouville type theorems on smooth compact Riemannian manifolds with nonnegative sectional curvature and strictly convex boundary. This gives a nonlinear generalization in low dimension of the recent sharp lower bound of the…
In recent years, eigenvalue optimization problems have received a lot of attention, in particular, due to their connection with the theory of minimal surfaces. In the present paper we prove that on any orientable surface there exists a…
Eigenvalues of a graph are of high interest in graph analytics for Big Data due to their relevance to many important properties of the graph including network resilience, community detection and the speed of viral propagation. Accurate…
We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.
Inspired by the Li--Yau eigenvalue-diameter estimates, we investigate lower bounds for the first Dirichlet eigenvalue in terms of the diameter (or inscribed radius) of a graph. Let $G = (V, E)$ be a graph with boundary $B$. Assume that the…
In this paper, we study the Steklov eigenvalue of a Riemannian manifold (M, g) with smooth boundary. For compact M , we establish a Cheeger-type inequality for the first Steklov eigenvalue by the isocapacitary constant. For non-compact M ,…
We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…
In this note we study the eigenvalue problem for a quadratic form associated with Strichartz estimates for the Schr\"{o}dinger equation, proving in particular a sharp Strichartz inequality for the case of odd initial data. We also describe…
In recent decades qualitative inverse scattering methods with eigenvalues as target signatures received much attention. To understand those methods a knowledge on the properties of the related eigenvalue problems is essential. However, even…
The paper is concerned with the Steklov eigenvalue problem on cuboids of arbitrary dimension. We prove a two-term asymptotic formula for the counting function of Steklov eigenvalues on cuboids in dimension d greater or equal to 3. Apart…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. Its correct interpretation as a measure of uniformity of the degree sequence requires the determination of its extremal…
In this paper, we firstly establish a new volume growth estimate for spacelike entire graphs in the pseudo-Euclidean space $\mathbb{R}^{m+n}_n$. Then by using this volume growth estimate and the Co-Area formula, we prove various rigidity…
In this paper, by imposing suitable assumptions on the weighted function, (under the constraint of fixed weighted volume) a Brock-type isoperimetric inequality for Steklov-type eigenvalues of the Witten-Laplacian on bounded domains in a…
The Hoffman ratio bound, Lov\'{a}sz theta function and Schrijver theta function are classical upper bounds for the independence number of graphs, which are useful in graph theory, extremal combinatorics and information theory. By using…
Let M be a compact Riemannian manifold with boundary. Let b>0 be the number of connected components of its boundary. For manifolds of dimension at least 3, we prove that it is possible to obtain an arbitrarily large (b+1)-th Steklov…
In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By…
For signed graphs we provide a cubic polynomial upper bound on the multiplicity of its eigenvalues. We show that this bound is sharp by providing examples of signed graphs in which it is attained. We also discuss particular cases in which…
In this paper, we consider the small and large eigenvalues of the one-dimensional Schr\"odinger operator L(q) with a periodic, real and locally integrable potential q. First we explicitly write out the first and second terms of the…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…