Maximization of the efficiency of the first Dirichlet eigenfunction and improved eigenvalue inequalities

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Della Pietra, Francesco
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915954933366784
author Della Pietra, Francesco
author_facet Della Pietra, Francesco
contents We study the efficiency of the first Dirichlet eigenfunction $u$ on bounded convex domains $Ω\subset \mathbb{R}^N$, defined as the ratio between the mean value of $u$ on $Ω$ and its maximum value. By exploiting improved log-concavity estimates, we establish new sharp lower bounds for the first eigenvalue $λ_1$ and upper bounds for the efficiency in terms of the geometry of the domain, refining classical inequalities by Payne, Stakgold, and Hersch. Furthermore, we investigate the asymptotic behavior of the efficiency for elongating planar convex domains, making use of 1D limit profiles and Schr{ö}dinger operators with convex potentials. As a main consequence of our analysis, we prove that among all planar convex domains the Payne-Stakgold upper bound is not optimal, and that there exists a maximizer of the efficiency.
format Preprint
id arxiv_https___arxiv_org_abs_2604_22410
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Maximization of the efficiency of the first Dirichlet eigenfunction and improved eigenvalue inequalities
Della Pietra, Francesco
Analysis of PDEs
Optimization and Control
We study the efficiency of the first Dirichlet eigenfunction $u$ on bounded convex domains $Ω\subset \mathbb{R}^N$, defined as the ratio between the mean value of $u$ on $Ω$ and its maximum value. By exploiting improved log-concavity estimates, we establish new sharp lower bounds for the first eigenvalue $λ_1$ and upper bounds for the efficiency in terms of the geometry of the domain, refining classical inequalities by Payne, Stakgold, and Hersch. Furthermore, we investigate the asymptotic behavior of the efficiency for elongating planar convex domains, making use of 1D limit profiles and Schr{ö}dinger operators with convex potentials. As a main consequence of our analysis, we prove that among all planar convex domains the Payne-Stakgold upper bound is not optimal, and that there exists a maximizer of the efficiency.
title Maximization of the efficiency of the first Dirichlet eigenfunction and improved eigenvalue inequalities
topic Analysis of PDEs
Optimization and Control
url https://arxiv.org/abs/2604.22410