Guth–Zahl polynomial Wolff axiom maximal inequality conjecture

Let T\mathbb{T} be a family of δ\delta-tubes in Rn\mathbb{R}^n. For DND\in\mathbb{N} and N1N\geqslant1, say that T\mathbb{T} satisfies the (D,N)(D,N)-polynomial Wolff axiom if, for every λδ\lambda\geqslant\delta and every semialgebraic set ERnE\subseteq\mathbb{R}^n of complexity at most DD,

#{TT:TEλT}Nδ(n1)λnE.\#\{T\in\mathbb{T}:|T\cap E|\geqslant\lambda|T|\}\leqslant N\delta^{-(n-1)}\lambda^{-n}|E|.

Guth–Zahl conjecture. Let pnn1p\geqslant\frac{n}{n-1}. For every ε>0\varepsilon>0, there are a complexity D=Dε,nND=D_{\varepsilon,n}\in\mathbb{N} and a constant Cε,n>0C_{\varepsilon,n}>0 such that, whenever 0<δ<10<\delta<1, N1N\geqslant1, and T\mathbb{T} satisfies the (D,N)(D,N)-polynomial Wolff axiom,

TTχTLp(Rn)Cε,nN11/pδ(n1n/p)ε(TTT)1/p.\Big\|\sum_{T\in\mathbb{T}}\chi_T\Big\|_{L^p(\mathbb{R}^n)}\leqslant C_{\varepsilon,n}N^{1-1/p}\delta^{-(n-1-n/p)-\varepsilon}\Big(\sum_{T\in\mathbb{T}}|T|\Big)^{1/p}.

This conjecture, attributed in the source to Guth and Zahl, is described as stronger than the Kakeya maximal conjecture in the relevant direction. The source notes that its precise formulation differs from the cited Guth–Zahl version in some respects, and does not report a resolution.

Sources & referencesView supporting material

Primary source

Jonathan Hickman, Keith M. Rogers and Ruixiang Zhang, “Improved bounds for the Kakeya maximal conjecture in higher dimensions”, arXiv:1908.05589 (2019).

Additional references

2 papers in this index state this conjecture (2019). The statement above is taken from the most recent of them; the others are arXiv:1901.01802.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.