Ruzsa's short-interval divisor conjecture

For integers NN and real aba\leqslant b, let τ(N;a,b)\tau(N;a,b) denote the number of divisors of NN in [a,b][a,b]. Ruzsa's conjecture. For every ε>0\varepsilon>0 there is C(ε)>0C(\varepsilon)>0 such that every positive integer NN satisfies

τ(N;N1/2,N1/2+N1/2ε)C(ε).\tau(N;N^{1/2},N^{1/2}+N^{1/2-\varepsilon})\leqslant C(\varepsilon).

The conjecture is known for ε>1/4\varepsilon>1/4, while the full assertion is open. The paper notes its close similarity to the paper's short-interval divisor conjecture.

Sources & referencesView supporting material

Primary source

Mikhail R. Gabdullin, “Trigonometric polynomials with frequencies in the set of squares”, arXiv:2205.13611 (2023).

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.