ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let m≥3m\geq 3 be odd, let nn be a non-negative integer, and let ff be a quadratic polynomial in nn variables modulo mm. Write q=2cos⁡(π2m)q=2\cos\left(\frac{\pi}{2m}\right) and let S(f,n,m)S(f,n,m) denote the associated normalized quadratic exponential sum. The quadratic exponential-sum conjecture.

∣S(f,n,m)∣≤(q2)⌊n+12⌋.\left|S(f,n,m)\right|\leq\left(\frac{q}{2}\right)^{\left\lfloor\frac{n+1}{2}\right\rfloor}.

Moreover, the upper bound is attained by all polynomials of the form

c(±x1x2±x3x4±⋯±xn−1xn)c(\pm x_1x_2\pm x_3x_4\pm\cdots\pm x_{n-1}x_n)

when nn is even, and by any polynomial of the form

c(±x1x2±x3x4±⋯±xn−1xn±xn+1)c(\pm x_1x_2\pm x_3x_4\pm\cdots\pm x_{n-1}x_n\pm x_{n+1})

when nn is odd, where c=⌊m+14⌋c=\left\lfloor\frac{m+1}{4}\right\rfloor. The conjecture would give a sharp, exponentially decreasing bound for incomplete quadratic exponential sums; it was verified in the paper for quadratic polynomials when n≤10n\leq 10, while the general case remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.