Baker–Montgomery conjecture on zeros of Fekete polynomials

About 2 years old · traced to

Let DD be a fundamental discriminant, and let NDN_D denote the number of zeros of the Fekete polynomial FDF_D in (0,1)(0,1). Baker–Montgomery conjecture. For almost all fundamental discriminants DD,

ND≍log⁡log⁡∣D∣.N_D\asymp \log\log |D|.

This conjecture gives a strong quantitative refinement of the failure of Fekete's conjecture, which asserted that FDF_D has no zeros in (0,1)(0,1) for sufficiently large DD. Baker and Montgomery proved only that ND≥KN_D\geq K for every fixed integer K≥1K\geq1 for almost all fundamental discriminants; the stated order of magnitude remains unresolved in the supplied text.

References

Primary source

Oleksiy Klurman, Youness Lamzouri and Marc Munsch, “Sign changes of short character sums and real zeros of Fekete polynomials”, arXiv:2403.02195 (2024).

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.