Bounded-average-partial-quotient approximation conjecture

From papers

Fix an integer B2B\geq2, and let CB\mathcal{C}_B be the set of irrational numbers whose partial quotients are bounded in average by BB. For each nn, consider rational points k/nk/n with k[n]k\in[n]. Bounded-average approximation conjecture. For some integer B2B\geq2,

infαCBmink[n]knαlognn2.\inf_{\alpha\in\mathcal{C}_B}\min_{k\in[n]}\left|\frac{k}{n}-\alpha\right|\ll\frac{\log n}{n^2}.

The paper cannot prove this approximation statement, although it believes it holds for some very small BB; the preceding proposition shows that it would imply the weak logarithmic discrepancy conjecture.

Progress summary

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

Sources & referencesView supporting material

Primary source

Joshua N. Cooper, “Quasirandom Arithmetic Permutations”, arXiv:math/0310384 (2006).

Solutions 0

No solutions have been posted yet.