Logarithmic square-norm conjecture for the Fourier interpolation basis functions

From papers

Let fn(x)f_n(x) be the Fourier interpolation basis functions. Logarithmic square-norm conjecture. For n>1n>1, one has

0fn(x)2dxlogn.\int_0^\infty |f_n(x)|^2\,dx\asymp\log n.

The lower bound is already known from the result cited in the paper, so the conjecture concerns the corresponding upper bound. If true, it would make the lower bound in the paper's square-norm theorem optimal up to a multiplicative constant.

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

David Berghaus, Andriy Bondarenko, Danylo Radchenko, Kristian Seip and Qihang Sun, “The basis functions of Fourier interpolation”, arXiv:2512.18677 (2025).

Solutions 0

No solutions have been posted yet.