pith. sign in

arxiv: 1511.03869 · v1 · pith:PLRT3PR2new · submitted 2015-11-12 · 🧮 math.NT

An improved bound for the star discrepancy of sequences in the unit interval

classification 🧮 math.NT
keywords discrepancyknownldotssequencestarboundcdotconstant
0
0 comments X
read the original abstract

It is known that there is a constant $c>0$ such that for every sequence $x_1, x_2,\ldots$ in $[0,1)$ we have for the star discrepancy $D^{*}_N$ of the first $N$ elements of the sequence that $N D^{*}_N\geq c\cdot \log N$ holds for infinitely many $N$. Let $c^{*}$ be the supremum of all such $c$ with this property. We show $c^{*}>0.065664679\ldots$, thereby slightly improving the estimates known until now.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.