### Sharp stability for the Brunn-Minkowski inequality for arbitrary sets

Combinatorics Seminar

17th October 2023, 11:00 am – 12:00 pm

Fry Building, 2.04

The Brunn-Minkowski inequality states that for (open) sets A and B in R^d, we have |A+B|^{1/d} \geq |A|^{1/d}+|B|^{1/d}. Equality holds if and only if A and B are convex and homothetic sets in R^d. In this talk, I'll present a sharp stability result for the Brunn-Minkowski inequality, concluding a long line of research on this problem. We show that if we are close to equality in the Brunn-Minkowski inequality, then A and B are close to being homothetic and convex, establishing the exact dependency between the three notions of closeness. Additionally, I’ll discuss analogous results in the discrete setting. This talk is based on joint work with Alessio Figalli (ETHZ) and Marius Tiba (Oxford).

## Comments are closed.