Weak approximation results for quadratic forms in four variables
Abstract
Let F be a quadratic form in four variables, let m∈N and let k∈ Z4. We count integer solutions to F(x)=0 with x k\:mod(m). One can compare this to the similar problem of counting solutions to F(x)=0 without the congruence condition. It turns out that adding the congruence condition sometimes gives a very different main term than the homogeneous case. In particular, there are examples where the number of primitive solutions to the problem is 0, while the number of unrestricted solutions is nonzero.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.