ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Q(x,y):=Ax2+2Bxy+Cy2+Dx+Ey+FQ(x,y):=Ax^2+2Bxy+Cy^2+Dx+Ey+F be a binary quadratic form with integral coefficients satisfying

max⁡(∣A∣,∣B∣,∣C∣,∣E∣,∣F∣)≤M,\max(|A|,|B|,|C|,|E|,|F|)\leq M,

and with discriminant

Disc⁡(Q):=B2−AC=q2\operatorname{Disc}(Q):=B^2-AC=q^2

for a prime q=4k+1q=4k+1. Suppose that Q(x,y)Q(x,y) is positive throughout the box (x,y)∈[−M1,M1]×[−M2,M2](x,y)\in[-M_1,M_1]\times[-M_2,M_2], where M1,M2≥1M_1,M_2\geq1. Cramer-type conjecture. There exists an exponent γ≥1/2\gamma\geq1/2 and a constant CγC_\gamma, independent of QQ, qq, and the box, such that whenever

Cγlog⁡(M)γ≤M1M2,C_\gamma\log(M)^\gamma\leq M_1M_2,

QQ represents a sum of two squares at some point inside the box [−M1,M1]×[−M2,M2][-M_1,M_1]\times[-M_2,M_2]. This is proposed as an analogue of Cramer's conjecture for the distribution of numbers representable as sums of two squares; it is used to motivate a polylogarithmic algorithm for the constrained representation problem.

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.