We investigate isoperimetric upper bounds for sums of consecutive Steklov eigenvalues of planar domains. The normalization involves the perimeter and scale-invariant geometric factors which measure deviation of the domain from roundness. We prove sharp upper bounds for both starlike and simply connected domains for a large collection of spectral functionals including partial sums of the zeta function and heat trace. The proofs rely on a special class of quasiconformal mappings.
Turning now to lower bounds, the minimum of each eigenvalue @math among domains of fixed perimeter or fixed volume is easily seen to be zero, by a pinching'' construction [Section 2.2] GP10b . Geometric lower bounds must therefore involve some other restrictions. An early result is that of Kuttler--Sigillito @cite_2 , who considered planar starlike domains and gave a bound in terms of the radius function and its derivative (see sec:starlike ). One should also mention a recent paper of Jammes @cite_17 , where a lower bound in the spirit of the classical Cheeger inequality is proved for the first nonzero Steklov eigenvalue. See also @cite_13 .
@cite_13 @cite_17 @cite_2
2964153620 2067534086 2508919161 1983665969
We give an overview of results on shape optimization for low eigenvalues of the Laplacian on bounded planar domains with Neumann and Steklov boundary conditions. These results share a common feature: they are proved using methods of complex analysis. In particular, we present modernized proofs of the classical inequalities due to Szego and Weinstock for the first nonzero Neumann and Steklov eigenvalues. We also extend the inequality for the second nonzero Neumann eigenvalue, obtained recently by Nadirashvili and the authors, to nonhomogeneous membranes with log-subharmonic densities. In the homogeneous case, we show that this inequality is strict, which implies that the maximum of the second nonzero Neumann eigenvalue is not attained in the class of simply connected membranes of a given mass. The same is true for the second nonzero Steklov eigenvalue, as follows from our results on the Hersch–Payne–Schiffer inequalities. Copyright © 2009 John Wiley & Sons, Ltd. Let (Mn, g) be a compact Riemannian manifold with boundary and dimensionn⩾2. In this paper we discuss the first non-zero eigenvalue problem (1) Problem (1) is known as the Stekloff problem because it was introduced by him in 1902, for bounded domains of the plane. We discuss estimates of the eigenvalueν1in terms of the geometry of the manifold (Mn, g). In the two-dimensional case we generalize Payne's Theorem [P] for bounded domains in the plane to non-negative curvature manifolds. In this case we show thatν1⩾k0, wherekg⩾k0andkgrepresents the geodesic curvature of the boundary. In higher dimensionsn⩾3 for non-negative Ricci curvature manifolds we show thatν1>k0 2, wherek0is a lower bound for any eigenvalue of the second fundamental form of the boundary. We introduce an isoperimetric constant and prove a Cheeger's type inequality for the Stekloff eigenvalue. [See the paper for the full abstract.] We show tight upper and lower bounds for time-space trade-offs for the @math -Approximate Near Neighbor Search problem. For the @math -dimensional Euclidean space and @math -point datasets, we develop a data structure with space @math and query time @math for every @math such that: This is the first data structure that achieves sublinear query time and near-linear space for every approximation factor @math , improving upon [Kapralov, PODS 2015]. The data structure is a culmination of a long line of work on the problem for all space regimes; it builds on Spherical Locality-Sensitive Filtering [Becker, Ducas, Gama, Laarhoven, SODA 2016] and data-dependent hashing [Andoni, Indyk, Nguyen, Razenshteyn, SODA 2014] [Andoni, Razenshteyn, STOC 2015]. Our matching lower bounds are of two types: conditional and unconditional. First, we prove tightness of the whole above trade-off in a restricted model of computation, which captures all known hashing-based approaches. We then show unconditional cell-probe lower bounds for one and two probes that match the above trade-off for @math , improving upon the best known lower bounds from [Panigrahy, Talwar, Wieder, FOCS 2010]. In particular, this is the first space lower bound (for any static data structure) for two probes which is not polynomially smaller than the one-probe bound. To show the result for two probes, we establish and exploit a connection to locally-decodable codes. Let 0 = λ1 < λ2 ≤ λ3 ≤ … be the Stekloff eigenvalues of a plane domain. The paper is concerned with formulas for ∑∞2λ(–2)j in simply and doubly connected domains. In the simply connected case it is proven that the disk minimized this sum. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)