Optimal polynomial tractability exponents for the inverse star discrepancy

The inverse of the star discrepancy n⁽d, ε) satisfies \[ d ε⁻¹ n^{}(d,ε) dε⁻² \] for all d ∈ N and 0 < ε < ε₀. The upper bound was established by Heinrich, Novak, Wasilkowski and Woźniakowski (2001), while the lower bound is due to Hinrichs (2004). Steinerberger (2023) subsequently gave an elementary proof of the latter result. These bounds imply that the inverse of the star discrepancy depends linearly on the dimension, but the exact exponent of ε⁻¹ had remained open. In this paper we prove a lower bound which shows that the exponent $2$ of ε⁻¹ in the upper bound cannot be improved. More precisely, for every $0<α<1$ and fixed $00$ and εα,A>0 such that, for every 0<ε<εα,A and every integer d satisfying \[ Aε-α≤ d≤ Bε-α, \] one has \[ n^(d,ε) ≥ cα,B\,d\,ε-(2-α). \] Along these polynomial strips the right-hand side is of order ε⁻². Consequently, every uniform polynomial upper estimate n^(d,ε)≤ C dqε⁻ᵖ must satisfy p≥2. Together with the lower bound of Hinrichs (2004), which forces q≥1, this proves that the exponents $p=2$ and $q=1$ in the Heinrich--Novak--Wasilkowski--Woźniakowski upper bound are individually optimal. In particular, the optimal exponent p^ = 2.