← All problems

Erdős Problem #992 — Metric discrepancy of dilated sequences

62 years old · traced to

Let (xn)n≥1(x_n)_{n\ge1} be any strictly increasing sequence of integers. For α∈[0,1]\alpha\in[0,1] and positive integer NN, let {αxn}\{\alpha x_n\} denote the fractional part, and define the (unnormalized) interval discrepancy by

D(N)=sup⁡I an interval in [0,1]∣#{n≤N:{αxn}∈I}−∣I∣N∣,D(N)=\sup_{I\text{ an interval in }[0,1]}\left|\#\{n\le N:\{\alpha x_n\}\in I\}-|I|N\right|,

where ∣I∣|I| is the length of II. The question asks whether, for every such sequence and for Lebesgue-almost every α\alpha, as N→∞N\to\infty,

D(N)≪N1/2(log⁡N)o(1),D(N)\ll N^{1/2}(\log N)^{o(1)},

and, more strongly, whether one can always obtain

D(N)≪N1/2(log⁡log⁡N)O(1).D(N)\ll N^{1/2}(\log\log N)^{O(1)}.

Erdős Problem #992 Aistleitner and Berkes, Probability and metric discrepancy theory

Background

Weyl’s metric theorem says that for any sequence of distinct integers (xn)(x_n), the fractional parts {αxn}\{\alpha x_n\} are uniformly distributed for almost every α\alpha. Discrepancy measures the finite-NN error in this distribution. Erdős’s 1964 discussion asks how far the available almost-everywhere rate can be improved; the earlier metric bounds of Erdős–Koksma and Cassels provide its starting point. A standard analytic approach relates discrepancy to exponential sums involving e2πihαxne^{2\pi i h\alpha x_n} through inequalities such as Erdős–Turán. Aistleitner and Berkes, Probability and metric discrepancy theory Erdős, Problems and results on diophantine approximations (1964)

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.