Discrete Spherical Averages
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact info@newton.ac.uk.
ASC - Approximation, sampling and compression in data science
The strongest inequalities concerning continuous spherical averages are phrased in the language of $L^p$ improving inequalities. Replace the continuous averages by discrete averages, that is average over lattice points on a sphere. These inequalities then engage the continuous versions, the Hardy-Littlewood circle method, and Kloosterman sums. We will report on progress understanding these inequalities. Joint work with Robert Kesler, and Dario Mena.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|