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. Stronger form of the 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, if

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

then

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

This refines the proposed global bound by controlling the next possible magnitude of a quadratic exponential sum. The paper states that the global conjecture has been verified for quadratic ff when n≤10n\leq 10, but the stronger assertion 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.