arXiv · 2611.06998
Resolving Tusnády's Problem
Abstract
We prove a lower bound of $Ω_d((\log N)^{d-1/2})$ for the worst-case combinatorial discrepancy of $N$-point sets with respect to anchored boxes in every fixed dimension $d\ge3$. Together with Nikolov's upper bound of the same order and Wei's planar lower bound, this settles Tusnády's problem: the discrepancy of axis-parallel boxes is $Θ_d((\log N)^{d-1/2})$ in every fixed dimension $d\ge2$. The proof combines smoothed product test functions, sampling discretization, and an entropy argument for conditioned Gaussian vectors.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Nicola Wengiel. 2026-11-04. Resolving Tusnády's Problem. https://arxiv.org/abs/2611.06998
Cite the original work for its findings. Save a collection to share your selection of sources.