The general Burgess-like character-sum conjecture

Let qq be a positive integer, let χ\chi be a non-principal character modulo qq, and let xx satisfy xl(q)x\gg l(q), where l:R+R+l:\mathbb{R}^+\rightarrow\mathbb{R}^+ is fixed. Let c:NNc:\mathbb{N}\rightarrow\mathbb{N} be a function.

General Burgess-like character-sum conjecture. For a certain function c:NNc:\mathbb{N}\rightarrow\mathbb{N}, one has

nxχ(n)xc(x).\sum_{n\leqslant x}\chi(n)\ll \frac{x}{c(x)}.

This is a general formulation of the Burgess-like input used in the paper's exponential-sum argument. The statement leaves the functions ll and cc at the level specified above, so the strength and scope of the resulting character-sum estimate depend on their choice.

Sources & referencesView supporting material

Primary source

Matteo Bordignon, “A note on medium and short character sums”, arXiv:2303.01848 (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.