scholarly journals Isoperimetric Upper Bound for the First Eigenvalue of Discrete Steklov Problems

Author(s):  
Hélène Perrin

AbstractWe 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 bound for the first non-zero Steklov eigenvalue depending on the number of vertices of the graph and of its boundary. As a corollary, if the graph with boundary also satisfies a discrete isoperimetric inequality, we show that the first non-zero Steklov eigenvalue tends to zero as the number of vertices of the graph tends to infinity. This extends recent results of Han and Hua, who obtained a similar result in the case of $$\mathbb {Z}^n$$ Z n . We obtain the result using metric properties of Cayley graphs associated to groups of polynomial growth.

Author(s):  
Bruno Colbois ◽  
Alessandro Savo

AbstractWe obtain upper bounds for the first eigenvalue of the magnetic Laplacian associated to a closed potential 1-form (hence, with zero magnetic field) acting on complex functions of a planar domain $$\Omega $$ Ω , with magnetic Neumann boundary conditions. It is well known that the first eigenvalue is positive whenever the potential admits at least one non-integral flux. By gauge invariance, the lowest eigenvalue is simply zero if the domain is simply connected; then, we obtain an upper bound of the ground state energy depending only on the ratio between the number of holes and the area; modulo a numerical constant the upper bound is sharp and we show that in fact equality is attained (modulo a constant) for Aharonov-Bohm-type operators acting on domains punctured at a maximal $$\epsilon $$ ϵ -net. In the last part, we show that the upper bound can be refined, provided that one can transform the given domain in a simply connected one by performing a number of cuts with sufficiently small total length; we thus obtain an upper bound of the lowest eigenvalue by the ratio between the number of holes and the area, multiplied by a Cheeger-type constant, which tends to zero when the domain is metrically close to a simply connected one.


2013 ◽  
Vol 169 (1) ◽  
pp. 397-410 ◽  
Author(s):  
Raveendran Binoy ◽  
G. Santhanam

2001 ◽  
Vol 45 (3) ◽  
pp. 851-863 ◽  
Author(s):  
Hilário Alencar ◽  
Manfredo do Carmo ◽  
Fernando Marques

2019 ◽  
Vol 72 (4) ◽  
pp. 1024-1043 ◽  
Author(s):  
Pedro Freitas ◽  
Richard S. Laugesen

AbstractThe second eigenvalue of the Robin Laplacian is shown to be maximal for the disk among simply-connected planar domains of fixed area when the Robin parameter is scaled by perimeter in the form $\unicode[STIX]{x1D6FC}/L(\unicode[STIX]{x1D6FA})$, and $\unicode[STIX]{x1D6FC}$ lies between $-2\unicode[STIX]{x1D70B}$ and $2\unicode[STIX]{x1D70B}$. Corollaries include Szegő’s sharp upper bound on the second eigenvalue of the Neumann Laplacian under area normalization, and Weinstock’s inequality for the first nonzero Steklov eigenvalue for simply-connected domains of given perimeter.The first Robin eigenvalue is maximal, under the same conditions, for the degenerate rectangle. When area normalization on the domain is changed to conformal mapping normalization and the Robin parameter is positive, the maximiser of the first eigenvalue changes back to the disk.


Sign in / Sign up

Export Citation Format

Share Document