A global quantitative square-stability bound for rectangles
Statement
Cheeger's inequality on convex sets
For an open set of finite measure , denote the first eigenvalue of the Laplacian with Dirichlet boundary conditions, and the Cheeger constant which may be defined as [h(\Omega)=\inf_{A\subset \Omega}\frac{|\partial A|}{|A|}=\inf_{u\in\mathcal{C}^\infty_c(\Omega)}\frac{\int_{\Omega}|\nabla u|}{\int_{\Omega}u}] Cheeger's inequality is [\lambda_1(\Omega)\geq \frac{1}{4}h(\Omega)^2] and the constant is sharp in the sense that the ratio tends to when is taken to be the unit ball of for . It is however not sharp when is restricted to be a planar convex sets, as is shown for instance by the result of I. Ftouhi: [\frac{\lambda_1(\Omega)}{h(\Omega)^2}\geq 0.902] Ilias Ftouhi's conjecture is that the optimal bound is , which is reached exactly when is a square.
An optimal set is known to exist, by standard compactness arguments, but it is unknown whether this optimal set is a polygon. A first stepping stone would be to examine the case of polygonal sets, where the Cheeger set (the optimal set ``'' in the definition) should coincide with the boundary of on some part, or leave the boundary tangentially following circle arcs (as described in [kawohl, lachand-robert]).
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.