On Minkowski symmetrizations of α-concave functions and related applications
Abstract
The Minkowski symmetral of an α-concave function is studied, and some of its fundamental properties are derived. It is shown that for a given α-concave function, there exists a sequence of Minkowski symmetrizations that hypo-converges to its ``reflectional hypo-symmetrization''. As an application, it is shown that the reflectional hypo-symmetrization of a log-concave function f is always harder to approximate than f is by ``inner log-linearizations'' with a fixed number of break points. This is a functional analogue of the classical geometric result which states that among all convex bodies of a given mean width, a Euclidean ball is hardest to approximate by inscribed polytopes with a fixed number of vertices. Finally, a general extremal property of the reflectional hypo-symmetrization is deduced, which includes a Urysohn-type inequality and the aforementioned approximation result as special cases.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.