Hacker News new | ask | show | jobs
by mikeiavelli 841 days ago
From the paper "Pólya’s conjecture for Euclidean balls" https://dms.umontreal.ca/~iossif/polya.pdf

"The celebrated Pólya’s conjecture (1954) in spectral geometry states that the eigenvalue counting functions of the Dirichlet and Neumann Laplacian on a bounded Euclidean domain can be estimated from above and below, respectively, by the leading term of Weyl’s asymptotics. Pólya’s conjecture is known to be true for domains which tile Euclidean space, and, in addition, for some special domains in higher dimensions. In this paper, we prove Pólya’s conjecture for the disk, making it the first non-tiling planar domain for which the conjecture is verified. We also confirm Pólya’s conjecture for arbitrary planar sectors, and, in the Dirichlet case, for balls of any dimension. Along the way, we develop the known links between the spectral problems in the disk and certain lattice counting problems. A key novel ingredient is the observation, made in recent work of the last named author, that the corresponding eigenvalue and lattice counting functions are related not only asymptotically, but in fact satisfy certain uniform bounds."