Related papers: Bounds on eigenvalue ratios of quantum graphs

The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be…

We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms…

Motivated by relativistic materials, we develop a numerical scheme to support existing or state new conjectures in the spectral optimisation of eigenvalues of the Dirac operator, subject to infinite-mass boundary conditions. We study the…

We study upper bounds for the first non-zero eigenvalue of the Steklov problem defined on finite graphs with boundary. For finite graphs with boundary included in a Cayley graph associated to a group of polynomial growth, we give an upper…

In this paper, we prove a sharp lower bound of the first (nonzero) eigenvalue of Finsler-Laplacian with the Neumann boundary condition. Equivalently, we prove an optimal anisotropic Poincar\'e inequality for convex domains, which…

We prove a lower bound on the first eigenvalue of the fractional Dirichlet-Laplacian of order $s$ on planar open sets, in terms of their inradius and topology. The result is optimal, in many respects. In particular, we recover a classical…

We study the approximation of eigenvalues for the Laplace-Beltrami operator on closed Riemannian manifolds in the class $\mathcal{M}$, characterized by bounded Ricci curvature, a lower bound on the injectivity radius, and an upper bound on…

In this paper we study an optimal shape design problem for the first eigenvalue of the fractional $p-$laplacian with mixed boundary conditions. The optimization variable is the set where the Dirichlet condition is imposed (that is…

In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…

In this work, we obtain the first upper bound on the multiplicity of Laplacian eigenvalues for negatively curved surfaces which is sublinear in the genus g. Our proof relies on a trace argument for the heat kernel, and on the idea of…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

We consider several semidefinite programming relaxations for the max-$k$-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…

A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…

Let $\tau_k(\Omega)$ be the $k$-th eigenvalue of the Laplace operator in a bounded domain $\Omega$ of the form $\Omega_{\text{out}} \setminus \overline{B_{\alpha}}$ under the Neumann boundary condition on $\partial \Omega_{\text{out}}$ and…

We study the eigenvalue problem for the $p$-Laplacian on K\"ahler manifolds. Our first result is a lower bound for the first nonzero eigenvalue of the $p$-Laplacian on compact K\"ahler manifolds in terms of dimension, diameter, and lower…

We give lower bounds for the first non-zero Steklov eigenvalue on connected graphs. These bounds depend on the extrinsic diameter of the boundary and not on the diameter of the graph. We obtain a lower bound which is sharp when the cardinal…

The purpose of the paper is to present quantitative estimates for the principal eigenvalue of discrete p-Laplacian on the set of rooted trees. Alternatively, it is studying the optimal constant of a class of weighted Hardy inequality. Three…

In this work, we obtain estimates for the upper bound of gaps between consecutive eigenvalues for the eigenvalue problem of a class of second-order elliptic differential operators in divergent form, with Dirichlet boundary conditions, in a…