betaFeedback

WorksMathematics

Pólya inequalities on thin planar networks

Abstract

We construct thin planar domains on which the Dirichlet and the Neumann Pólya inequalities both hold strictly. For the neighborhoods of a given finite connected embedded polygonal graph (branches and cycles are allowed) there is a single radius threshold below which both inequalities hold for every eigenvalue index. We also show that every nonempty bounded connected open set in the plane can be approximated, in measure and in the Hausdorff distance, by smooth simply connected domains satisfying both inequalities. Along the same sequence, the first Dirichlet eigenvalue tends to infinity, while each Neumann eigenvalue of fixed positive index tends to zero. In the special case of rectangular frames our estimates lead to explicit sufficient conditions, with no restriction on the aspect ratio.

Paper details

vlnc:W_yhsmkn7b
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC-BY-NC-ND-4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT, Claude Opus (multiple versions)

View statement
Looking for related papers…