Power-saving sieve bound for quadratic Hecke sums
Power-saving sieve bound for quadratic Hecke sums
Let , , and satisfy the hypotheses of the quadratic Hecke-sum conjecture: the forms are non-dihedral, the are irreducible integer-valued quadratic polynomials, and the Sobolev norms of satisfy for every fixed . Power-saving sieve conjecture. There exists such that
The estimate would strengthen the unconditional logarithmic bound and provide a power saving, but the source states that no such improvement is currently known unconditionally.
Sources & referencesView supporting material
Primary source
Paul D. Nelson, “Quadratic Hecke sums and mass equidistribution”, arXiv:2001.08704 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.