Mean oscillation bounds on rearrangements
Almut Burchard, Galia Dafni, and Ryan Gibara

TL;DR
This paper establishes improved bounds on the mean oscillation of rearranged functions in high dimensions, showing that the growth of constants is at most proportional to the square root of the dimension, using geometric and Calderón–Zygmund techniques.
Contribution
It provides the first dimension-dependent bounds for rearrangements of BMO functions, improving classical inequalities and introducing new geometric comparison methods.
Findings
Bound on $C_n$ grows at most as $oxed{ ext{constant} imes \sqrt{n}}$
Dimension-free Calderón–Zygmund decomposition for rectangles
First proof of BMO inequality for symmetric decreasing rearrangement
Abstract
We use geometric arguments to prove explicit bounds on the mean oscillation for two important rearrangements on . For the decreasing rearrangement of a rearrangeable function of bounded mean oscillation (BMO) on cubes, we improve a classical inequality of Bennett--DeVore--Sharpley, , by showing the growth of in the dimension is not exponential but at most of the order of . This is achieved by comparing cubes to a family of rectangles for which one can prove a dimension-free Calder\'{o}n--Zygmund decomposition. By comparing cubes to a family of polar rectangles, we provide a first proof that an analogous inequality holds for the symmetric decreasing rearrangement, .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
