Matching works

1 work

math.SP — Spectral Theory

The equilateral triangle maximises the first Steklov eigenvalue among triangles

Contributed by Jason Davies

Let σ1(T)\sigma_1(T) be the first nonzero Steklov eigenvalue of a triangle TT and L(T)L(T) its perimeter. Among triangles the equilateral triangle EE uniquely maximises σ1L\sigma_1 L. If the shortest and longest sides of TT have lengths a≤ba\le b, then σ1(E)L(E)−σ1(T)L(T)≥(b−a)/(2b)\sigma_1(E)L(E)-\sigma_1(T)L(T)\ge (b-a)/(2b). Since ∣T∣/L(T)2|T|/L(T)^2 is also maximal at EE, the equilateral triangle uniquely maximises σ1∣T∣\sigma_1\sqrt{|T|} as well. This settles the case n=3n=3 of the Steklov analogue of the Pólya–Szegő conjecture for nn-gons, for both normalisations. The extremal value satisfies 3.8724615957722≤σ1(E)L(E)≤3.87246159577343.8724615957722\le \sigma_1(E)L(E)\le 3.8724615957734. For side length one, σ1(E)=σ2(E)<σ3(E)=23<σ4(E)\sigma_1(E)=\sigma_2(E)<\sigma_3(E)=2\sqrt3<\sigma_4(E). Under displacement of the apex over a fixed unit base, the first two perimeter-normalised eigenvalues split linearly with equal and opposite slopes independent of direction. The proof is computer-assisted. Near EE we transplant the first eigenspace of EE affinely; away from EE the trial function cos⁡(πx)\cos(\pi x) suffices. We verify the finite matrix and interval inequalities in ball arithmetic.

Primarily AI-generated textHuman understanding: no partsPólya–Szegő conjectureSteklov eigenvaluescomputer-assisted proofinterval arithmeticshape optimizationtriangles
Nov 19, 202614 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations