← All problems

Uniform fourth-root bound conjecture for incomplete power sums

22 years old · documented by

Let pp be prime and define

S(a,k,M)=∑s=1Me(askp).S(a,k,M)=\sum_{s=1}^{M}e\left(\frac{a s^k}{p}\right).

Here aa is understood modulo pp, k∈Zp×k\in\mathbb{Z}_p^\times, and MM is in the range used for incomplete sums in the paper. Uniform power-sum conjecture. For all k∈Zp×k\in\mathbb{Z}_p^\times with (k,p−1)=1(k,p-1)=1 and k≥2k\geq2,

S(a,k,M)≪p3/4,S(a,k,M)\ll p^{3/4},

uniformly in aa, kk, and MM. Such a bound would imply quasirandomness of the associated power permutations and is stated as the paper's most intriguing conjecture, based on extensive computational evidence.

References
  1. Joshua N. Cooper, “Quasirandom Arithmetic Permutations”, arXiv:math/0310384 (2006).

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.