Related papers: Lower bounds for the first eigenvalue of the Stekl…

We investigate the question of sharp upper bounds for the Steklov eigenvalues of a hypersurface of revolution of the Euclidean space with two boundary components isometric to two copies of $\mathbb{S}^{n-1}$. For the case of the first non…

In this paper, we obtain a Lichnerowicz-type estimate for the first Steklov eigenvalues on graphs and discuss its rigidity.

For a compact, connected, orientable Riemannian manifold with $b$ boundary components, we obtain geometric lower bounds for the low Steklov eigenvalues, namely $\sigma_k$, $1\le k\le b-1$. Our results complement earlier results, which apply…

We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.

In this paper we find an upper bound for the first Steklov eigenvalue for a surface of revolution with boundary consisting of two spheres of different radii. Moreover, we prove that in some cases this boundary is sharp.

We study the Steklov problem on a subgraph with boundary $(\Omega,B)$ of a polynomial growth Cayley graph $\Gamma$. We prove that for each $k \in \mathbb{N}$, the $k^{\mbox{th}}$ eigenvalue tends to $0$ proportionally to…

We consider the relationship of the geometry of compact Riemannian manifolds with boundary to the first nonzero eigenvalue sigma_1 of the Dirichlet-to-Neumann map (Steklov eigenvalue). For surfaces Sigma with genus gamma and k boundary…

For a fixed positive integer $t$, we consider the graph colouring problem in which edges at distance at most $t$ are given distinct colours. We obtain sharp lower bounds for the distance-$t$ chromatic index, the least number of colours…

We prove a lower bound for the $k$-th Steklov eigenvalues in terms of an isoperimetric constant called the $k$-th Cheeger-Steklov constant in three different situations: finite spaces, measurable spaces, and Riemannian manifolds. These…

We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…

We obtain sharp upper bounds for the first two nonzero Steklov eigenvalues among bounded domains in Euclidean spaces of dimension $d \geq 7$ under a natural normalization involving volume and boundary measure. These bounds are derived from…

We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving…

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…

Using expander graphs, we construct a sequence of smooth compact surfaces with boundary of perimeter N, and with the first non-zero Steklov eigenvalue uniformly bounded away from zero. This answers a question which was raised in [9]. The…

We give explicit isoperimetric upper bounds for all Steklov eigenvalues of a compact orientable surface with boundary, in terms of the genus, the length of the boundary, and the number of boundary components. Our estimates generalize a…

It was conjectured by Escobar [J. Funct. Anal. 165 (1999), 101--116] that for an $n$-dimensional ($n\geq 3$) smooth compact Riemannian manifold with boundary, which has nonnegative Ricci curvature and boundary principal curvatures bounded…

We introduce a graph $\Gamma$ which is roughly isometric to the hyperbolic plane and we study the Steklov eigenvalues of a subgraph with boundary $\Omega$ of $\Gamma$. For $(\Omega_l)_{l\geq 1}$ a sequence of subraphs of $\Gamma$ such that…

In [1] the problem of finding a sharp lower bound on lower against number of a general graph is mentioned as an open question. We solve the problem by establishing a tight lower bound on lower against number of a general graph in terms of…

We explore the Steklov eigenvalue problem on convex polygons, focusing mainly on the inverse Steklov problem. Our primary finding reveals that, for almost all convex polygonal domains, there exist at most finitely many non-congruent domains…

We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs, having the number of maximal paths…