analysis / Spectral geometry

Strict Dirichlet Pólya inequality on simply connected planar domains

Theorem 1.1 of arXiv:2610.13139: for every bounded nonempty simply connected planar domain Ω\Omega, with no boundary regularity assumed, ∣Ω∣λj(Ω)>4πj|\Omega|\lambda_j(\Omega)>4\pi j for all j≥1j\ge1, equivalently ND(E)<∣Ω∣E/(4π)N_D(E)<|\Omega|E/(4\pi) for E>0E>0 (eigenvalues counted with multiplicity, endpoint included). This is the strict form of Pólya's Dirichlet inequality on the whole simply connected planar class. Previously it was known for tiling domains (Pólya 1961), disks and sectors (Filonov, Levitin, Polterovich and Sher 2023), annuli and a few further families. Multiply connected planar domains and higher dimensions remain open. The companion strict Neumann result for simply connected Lipschitz domains is a separate entry.

45Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

analysisOct 9, 2026Significance 45/100Registry: lean checked

Strict Dirichlet Pólya inequality on simply connected planar domains

Prior state unknown→proved

Theorem 1.1 of arXiv:2610.13139: for every bounded nonempty simply connected planar domain Ω\Omega, with no boundary regularity assumed, ∣Ω∣λj(Ω)>4πj|\Omega|\lambda_j(\Omega)>4\pi j for all j≥1j\ge1, equivalently ND(E)<∣Ω∣E/(4π)N_D(E)<|\Omega|E/(4\pi) for E>0E>0 (eigenvalues counted with multiplicity, endpoint included). This is the strict form of Pólya's Dirichlet inequality on the whole simply connected planar class. Previously it was kn…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1 of arXiv:2610.13139: for every bounded nonempty simply connected planar domain Ω\Omega, with no boundary regularity assumed, ∣Ω∣λj(Ω)>4πj|\Omega|\lambda_j(\Omega)>4\pi j for all j≥1j\ge1, equivalently ND(E)<∣Ω∣E/(4π)N_D(E)<|\Omega|E/(4\pi) for E>0E>0 (eigenvalues counted with multiplicity, endpoint included). This is the strict form of Pólya's Dirichlet inequality on the whole simply connected planar class. Previously it was known for tiling domains (Pólya 1961), disks and sectors (Filonov, Levitin, Polterovich and Sher 2023), annuli and a few further families. Multiply connected planar domains and higher dimensions remain open. The companion strict Neumann result for simply connected Lipschitz domains is a separate entry.

Theorem 1.1 of arXiv:2610.13139: for every bounded nonempty simply connected planar domain Ω\Omega, with no boundary regularity assumed, ∣Ω∣λj(Ω)>4πj|\Omega|\lambda_j(\Omega)>4\pi j for all j≥1j\ge1, equivalently ND(E)<∣Ω∣E/(4π)N_D(E)<|\Omega|E/(4\pi) for E>0E>0 (eigenvalues counted with multiplicity, endpoint included). This is the strict form of Pólya's Dirichlet inequality on the whole simply connected planar class. Previously it was known for tiling domains (Pólya 1961), disks and sectors (Filonov, Levitin, Polterovich and Sher 2023), annuli and a few further families. Multiply connected planar domains and higher dimensions remain open. The companion strict Neumann result for simply connected Lipschitz domains is a separate entry.

Recorded attempts

Evidence graph

Connected research record

Strict Dirichlet Pólya inequality on simply connected planar domains — Mathematical Frontier Network