Cramer-type conjecture for values of binary quadratic forms representing sums of two squares

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):=B2AC=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,M21M_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.

Sources & referencesView supporting material

Primary source

Naser T Sardari, “Complexity of strong approximation on the sphere”, arXiv:1703.02709 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.