ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let γ(t)=(t,t2,…,tn)\gamma(t)=(t,t^2,\ldots,t^n) and define Φ(t⃗)=∑i=1nγ(ti)\Phi(\vec t)=\sum_{i=1}^n\gamma(t_i). For t⃗∈[Z/NZ]n\vec t\in[\mathbb Z/N\mathbb Z]^n, let N(t⃗;N)\mathbf N(\vec t;N) be the number of s⃗∈[Z/NZ]n\vec s\in[\mathbb Z/N\mathbb Z]^n satisfying Φ(s⃗)=Φ(t⃗)\Phi(\vec s)=\Phi(\vec t). Use ∣tj−tk∣|t_j-t_k| for the least nonnegative representative of the difference's absolute value in the source's ring metric. Solution-count conjecture for Vinogradov systems modulo NN. For all ε>0\varepsilon>0 there exists a constant Cε,n>0C_{\varepsilon,n}>0 such that

N(t⃗;N)≤min⁡{Cε,nNε+n(n−1)/2∏1≤j<k≤n∣tj−tk∣−1, Nn}.\mathbf N(\vec t;N)\leq\min\left\{C_{\varepsilon,n}N^{\varepsilon+n(n-1)/2}\prod_{1\leq j<k\leq n}|t_j-t_k|^{-1},\,N^n\right\}.

This conjecture is suggested by comparison with the Euclidean Jacobian estimate and would control the multiplicities in the discrete convolution argument; the source does not establish it.

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.