Search arXivSearch

arXiv · 1602.01307

On an explicit lower bound for the star discrepancy in three dimensions

Abstract

Following a result of D.~Bylik and M.T.~Lacey from 2008 it is known that there exists an absolute constant $η>0$ such that the (unnormalized) $L^{\infty}$-norm of the three-dimensional discrepancy function, i.e, the (unnormalized) star discrepancy $D^{\ast}_N$, is bounded from below by $D_{N}^{\ast}\geq c (\log N)^{1+η}$, for all $N\in\mathbb{N}$ sufficiently large, where $c>0$ is some constant independent of $N$. This paper builds upon their methods to verify that the above result holds with $η<1/(32+4\sqrt{41})\approx 0.017357\ldots$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Florian Puchhammer. 2016-10-05. On an explicit lower bound for the star discrepancy in three dimensions. https://doi.org/10.1016/j.matcom.2016.08.006

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT