Bounded Representations by $x^2+y^2-z^2$

Abstract

We prove that every sufficiently large integer $n$ can be written in the form $n=x^2+y^2-z^2$ with $\text{max}(x^2,y^2,z^2)\le n$. The proof converts the problem into finding a primitive binary quadratic form of positive discriminant $4n$ inside a fixed relatively compact open patch of the real hyperboloid $b^2-4ac=4n$. This is then supplied by Duke's theorem in the precise point-counting form deduced from the measure-theoretic duality of Einsiedler-Lindenstrauss-Michel-Venkatesh. A finite parity correction returns to the original ternary variables. This settles Erdős Problem 1148.