ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let t=(t0,…,td−2)\mathbf t=(t_0,\ldots,t_{d-2}) and

Q(t):=Nq2−∑i=0d−2(ti+biq)2,Q(\mathbf t):=\frac{N}{q^2}-\sum_{i=0}^{d-2}\left(t_i+\frac{b_i}{q}\right)^2,

where N,b0,…,bd−2N,b_0,\ldots,b_{d-2} are integers, N≡∑i=0d−2bi2(modq)N\equiv\sum_{i=0}^{d-2}b_i^2\pmod q, and gcd⁡(N,q)=1\gcd(N,q)=1. For r>0r>0, let

AQ,r:={t∈Zd−1:Q(t)∈Z, ∣t∣<r, and Q(t)≥0}.A_{Q,r}:=\{\mathbf t\in\mathbb Z^{d-1}:Q(\mathbf t)\in\mathbb Z,\ |\mathbf t|<r,\text{ and }Q(\mathbf t)\geq0\}.

The sum-of-two-squares conjecture. There exist constants γ>0\gamma>0 and Cγ>0C_\gamma>0, independent of QQ and rr, such that if

∣AQ,r∣>Cγ(log⁡N)γ|A_{Q,r}|>C_\gamma(\log N)^\gamma

for some r>0r>0, then QQ expresses a sum of two squares inside AQ,rA_{Q,r}. This arithmetic conjecture is used to establish polynomial-time termination of the paper's conditional lifting algorithm.

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.