Pólya's conjecture and the Weyl–Berry conjecture for the Vladimirov–Taibleson operator
Let be an admissible bounded domain, let denote the Dirichlet realization of the Vladimirov–Taibleson operator, and let be its eigenvalue-counting function. If denotes the Weyl main term, Pólya's conjecture asks whether for every and every such domain ; equivalently, whether the corresponding Dirichlet eigenvalues satisfy the sharp lower bound prescribed by Weyl's law.
References
Primary source
Additional references
Progress summary
A new unrefereed paper reports that the p-adic analogues fail in general, while identifying the cases where a Pólya-type inequality survives.
The problem concerns Pólya's conjecture and the Weyl–Berry conjecture for the Vladimirov–Taibleson operator, contrasting these p-adic questions with their Archimedean counterparts.
August 2026 preprint
A new arXiv paper reports remainder estimates, proves failure of the Weyl–Berry conjecture for this operator, and characterizes the cases in which Pólya-type inequalities hold. These claims amount to a resolution of the tracked conjectures in the stated p-adic setting, but the preprint is unrefereed and independently unconfirmed.
Current status (as of August 2026): The preprint claims to settle the Weyl–Berry question negatively and to characterize Pólya-type inequalities, but these results remain unverified.
Sources
- arxiv.org
- arxiv.org
- quantamagazine.org
- quantamagazine.org
- www-cdn.anthropic.com
- www-cdn.anthropic.com
- anthropic.com
- quantamagazine.org
- scientificamerican.com
- arxiv.org
- ar5iv.labs.arxiv.org
- ar5iv.labs.arxiv.org
- export.arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- community.openai.com
- www-cdn.anthropic.com
- www-cdn.anthropic.com
Solutions 0
No solutions have been posted yet.