The circle method with weights for the representation of integers by quadratic forms
- 62 Downloads
When attacking Diophantine counting problems by the circle method, the use of smoothly weighted counting functions has become commonplace to avoid technical difficulties. It can, however, be problematic to then recover corresponding results for the unweighted number of solutions.
This paper looks at quadratic forms in four or more variables representing an integer. We show how an asymptotic formula for the number of unweighted solutions in an expanding region can be obtained despite applying a weighted version of the circle method. Moreover, by carefully choosing the weight, the resulting error term is made nontrivial. Bibliography: 9 titles.
KeywordsError Term Quadratic Form Technical Difficulty Asymptotic Formula Mathematical Institute
Unable to display preview. Download preview PDF.
- 2.G. H. Hardy and J. E. Littlewood, “Some problems of “Partitio Numerorum,” I: A new solution of Waring’s problem, in: Göttinger Nachrichten (1920), pp. 33–54.Google Scholar
- 7.B. Z. Moroz, “Distribution of integer points on multidimensional hyperboloids and cones,” Zap. Nauchn. Semin. LOMI, 1, 31–41 (1968).Google Scholar
- 9.N. Niedermowwe, “Zeros of forms with S-unit argument,” D. Phil. Thesis, University of Oxford (2009).Google Scholar