A Remark on Recent Lower Bounds for Nodal Sets
Dan Mangoubi

TL;DR
This paper introduces a new method for establishing power law lower bounds on the volume of nodal sets of eigenfunctions, complementing existing approaches and based on growth bounds and volume relations.
Contribution
It presents a third approach using Donnelly-Fefferman growth bounds and a growth-volume relation to derive lower bounds on nodal set sizes.
Findings
Provides a new method for lower bounds on nodal sets
Extends previous results with an alternative approach
Demonstrates the effectiveness of growth-volume relations
Abstract
Recently, Sogge-Zelditch and Colding-Minicozzi gave new power law lower bounds on the size of the nodal sets of eigenfunctions. The purpose of this short note is to point out a third method to obtain a power law lower bound on the volume of the nodal sets. Our method is based on the Donnelly-Fefferman growth bound for eigenfunctions and a growth vs. volume relation we proved in a previous work.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
