Discrete Spherical Averages
Duration: 43 mins 53 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
Description: |
Lacey, M
Monday 25th February 2019 - 15:00 to 16:00 |
---|
Created: | 2019-02-25 16:33 |
---|---|
Collection: | Approximation, sampling and compression in data science |
Publisher: | Isaac Newton Institute |
Copyright: | Lacey, M |
Language: | eng (English) |
Abstract: | The strongest inequalities concerning continuous spherical averages are phrased in the language of Lp 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. |
---|
Available Formats
Format | Quality | Bitrate | Size | |||
---|---|---|---|---|---|---|
MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 638.96 MB | View | Download | |
WebM | 640x360 | 360.95 kbits/sec | 116.06 MB | View | Download | |
iPod Video | 480x270 | 522.09 kbits/sec | 167.81 MB | View | Download | |
MP3 | 44100 Hz | 249.74 kbits/sec | 80.36 MB | Listen | Download | |
Auto * | (Allows browser to choose a format it supports) |