An extremal property of the symmetric decreasing rearrangement
Abstract
It is shown that for a given log-concave function, its symmetric decreasing rearrangement is always harder to approximate in the symmetric difference metric by inner log-linearizations with a fixed number of break points. This extends a classical result of Macbeath (1951) from convex bodies to a functional setting.
0
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.