COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Combinatorics Seminar > Sharp stability for the Brunn-Minkowski inequality for arbitrary sets
Sharp stability for the Brunn-Minkowski inequality for arbitrary setsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact ibl10. Note unusual room The Brunn-Minkowski inequality states that for (open) sets A and B in Rd, we have |A+B|{1/d} \geq |A|+|B|{1/d}. Equality holds if and only if A and B are convex and homothetic sets in R^d. In this talk, we present a sharp stability result for the Brunn-Minkowski inequality for arbitrary sets A and B, thus concluding a long line of research on this folklore problem. This is joint work with Alessio Figalli and Peter van Hintum. This talk is part of the Combinatorics Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCausal Inference Reading Group PDN Talks Office of Scholarly CommunicationOther talksDysfunctional microglia: key players in the pathogenesis of brain diseases Knowledge Issues and Language Models Modeling Physical Limits of Migrations Structure and dynamics of dense bacterial populations Writing 'Away day' Delayed yielding of amorphous materials |