2000 character limit reached
Improving a Constant in High-Dimensional Discrepancy Estimates (1810.11345v1)
Published 26 Oct 2018 in math.NT
Abstract: For all $s \geq 1$ and $N \geq 1$ there exist sequences $(z_1,\ldots,z_N)$ in $[0,1]s$ such that the star-discrepancy of these points can be bounded by $$D_N*(z_1,\ldots,z_N) \leq c \frac{\sqrt{s}}{\sqrt{N}}.$$ The best known value for the constant is $c=10$ as has been calculated by Aistleitner in \cite{Ais11}. In this paper we improve the bound to $c=9$.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.