On the Spectral Gap for Convex Domains
classification
🧮 math.SP
math-phmath.MPmath.PR
keywords
domainrectanglespectralaxesconvexboundedboundscentered
read the original abstract
We prove the following for a bounded convex planar domain that is symmetric with respect to both coordinate axes. Consider a centered rectangle with sides parallel to the axes that strictly contains the domain. If the domain is not a certain kind of rectangle, the spectral gap of the domain is larger than the spectral gap of the rectangle. We also provide explicit lower bounds for the differnce between the gaps.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.