Uniformly perfect measures on strictly convex planar graphs are $L^{2}$-flattening
Amir Algom, Tuomas Orponen
TL;DR
The paper proves an $L^{2}$-flattening phenomenon for uniformly perfect measures supported on strictly convex planar $C^{2}$ graphs, showing that for any such measure $\sigma$ there exists $p\ge 1$ with $\|\hat{\sigma}\|_{L^{p}(B(R))}^{p} \lesssim R^{\varepsilon}$ for all $R\ge 1$ and any $\varepsilon>0$. The argument blends one-dimensional inverse theorems (Rossi–Shmerkin and Shmerkin) with a geometric decompositional approach to the planar graph, exploiting curvature to force sumset growth and, consequently, decay in the Fourier side after mollification. Key steps include establishing $L^{2}$-flattening for convolutions with uniformly perfect measures, a refined Frostman-type control, and an iterative amplification of flattening through repeated convolutions. The results extend prior line-based flattening to curved curves in the plane, with potential implications for Fourier decay problems for measures on curves and surfaces, and complement existing affine non-concentration theories in higher dimensions.
Abstract
Uniformly perfect measures are a common generalisation of Ahlfors regular measures, self-conformal measures on the line, and their push-forwards under sufficiently regular maps. We show that every uniformly perfect measure $σ$ on a strictly convex planar $C^{2}$-graph is $L^{2}$-flattening. That is, for every $ε>0$, there exists $p = p(ε,σ) \geq 1$ such that $$\|\hatσ\|_{L^{p}(B(R))}^{p} \lesssim_{ε,σ} R^ε, \qquad R \geq 1.$$
