Pólya's conjecture for Euclidean balls (Q6072321)

From MaRDI portal
Revision as of 00:49, 3 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q123114639, #quickstatements; #temporary_batch_1714689923223)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7749816
Language Label Description Also known as
English
Pólya's conjecture for Euclidean balls
scientific article; zbMATH DE number 7749816

    Statements

    Pólya's conjecture for Euclidean balls (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 October 2023
    0 references
    Consider a domain \(\Omega\subset\mathbb R^d\) with Lipschitz boundary, and denote by \((\lambda_n)\) and \((\mu_n)\) the increasing sequences of eigenvalues of the Laplacian \(-\Delta\) on \(\Omega\), with Dirichlet and Neumann boundary conditions, respectively. It is a well known fact that the counting function for the Dirichlet eigenvalues, \(\mathscr N^{\mathrm{D}}(\lambda)=\#\{n\colon\lambda_n\leq \lambda\}\), is less than that of the Neumann eigenvalues, \(\mathscr N^{\mathrm{N}}(\lambda)=\#\{n\colon\mu_n\leq \lambda\}\), and that the Weyl's law \[ \mathscr N(\lambda)\underset{\lambda\to+\infty}{\sim} C_d|\Omega|\lambda^d \] holds for both the Dirichlet and Neumann counting functions. In [Patterns of plausible inference. Vol. II of mathematics and plausible reasoning. Princeton: Princeton University Press (1954; Zbl 0056.24102)], \textit{G. Pólya}'s conjectured that the two inequalities \[ \mathscr N^{\mathrm{D}}(\lambda)\leq C_d|\Omega|\lambda^d\quad\mbox{and}\quad \mathscr N^{\mathrm{N}}(\lambda)\geq C_d|\Omega|\lambda^d \] hold for all \(\lambda>0\). The first inequality can be called the Dirichlet Pólya conjecture, while the second one the Neumann Pólya conjecture. The authors of the paper under review nicely prove the Dirichlet Pólya conjecture when \(\Omega\) is a Euclidean ball, in any dimension, and in dimension 2, they prove the Neumann Pólya conjecture, thereby settling the Pólya conjecture for the disc. It is remarkable that a rigorous computer assisted proof is used to establish the Neumann Pólya conjecture when \(\lambda\in[3,14]\). Furthermore, the authors prove the Pólya conjecture for a circular sector, after observing that it tiles the disk. The proofs rely on deep links between the spectral problems in the disk and certain lattice counting problems.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lattice counting functions
    0 references
    rigorous computer-assisted argument
    0 references
    Dirichlet Pólya conjecture
    0 references
    Neumann Pólya conjecture
    0 references
    0 references