2000 character limit reached
Near Equality in the Brunn-Minkowski Inequality
Published 20 Jul 2012 in math.CA | (1207.5062v1)
Abstract: A pair of subsets of Euclidean space which nearly achieves equality in the Brunn-Minkowski inequality must nearly coincide with a pair of homothetic convex sets. The two-dimensional case was treated in a previous paper in this series by an argument which does not seem to generalize to higher dimensions. Here the result is extended to arbitrary dimensions. An induction on the dimension, a symmetrization argument, and a description of near solutions of an additive functional equation are used to establish sufficient regularity to set up a compactness argument.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.