Representations of integers by systems of three quadratic forms
Abstract
It is classically known that the circle method produces an asymptotic for the number of representations of a tuple of integers (n1,…,nR) by a system of quadratic forms Q1,…, QR in k variables, as long as k is sufficiently large; reducing the required number of variables remains a significant open problem. In this work, we consider the case of 3 forms and improve on the classical result by reducing the number of required variables to k ≥ 10 for "almost all" tuples, under appropriate nonsingularity assumptions on the forms Q1,Q2,Q3. To accomplish this, we develop a three-dimensional analogue of Kloosterman's circle method, in particular capitalizing on geometric properties of appropriate systems of three quadratic forms.
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.