The sum of multidimensional divisor function over values of quadratic polynomial
Nianhong Zhou

TL;DR
This paper derives explicit asymptotic formulas for the sum of the multidimensional divisor function over values of a positive quadratic polynomial in three or more variables, using the circle method.
Contribution
It provides the first explicit asymptotic formulas for sums involving the multidimensional divisor function over quadratic polynomial values in multiple variables.
Findings
Asymptotic formulas are obtained for the sum T_{k,F}(X).
Results apply to quadratic polynomials with non-zero discriminant.
The circle method is effectively used to analyze these sums.
Abstract
Let be a quadratic polynomial in variables , where is positive when , is an matrix and its discriminant . It gives explicit asymptotic formulas for the following sum \[ T_{k,F}(X)=\sum_{{\bf x}\in [1,X]^{\ell}\cap\mathbb{Z}^{\ell}}\tau_{k}\left(F({\bf x})\right) \] with the help of the circle method. Here with is the multidimensional divisor function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Meromorphic and Entire Functions · Advanced Mathematical Identities
The sum of multidimensional divisor function over values of quadratic polynomial
Nianhong Zhou
Department of Mathematics
East China Normal University
500 Dongchuan Road, Shanghai 200241, PR China
Abstract.
Let be a quadratic polynomial in variables , where is positive when , is an matrix and its discriminant . It gives an asymptotic formula for the following sum
[TABLE]
with the help of the circle method. Here with is the multidimensional divisor function.
Key words and phrases:
Divisor function; quadratic polynomial; circle method.
2010 Mathematics Subject Classification:
Primary: 11P55, Secondary: 11L07, 11N37.
1. Introduction
The multidimensional divisor functions are generalisations of the divisor function , defined by
[TABLE]
and counting the number of ways that can be written as a product of positive integer numbers. Understanding the average order of , as it ranges over the values taken by polynomials is an important topic in analytic number theory. The behavior of is far less than perfectly understood even for . For example, so far there are no asymptotic formulas for the sum . We considers the sum
[TABLE]
where is a binary form. For and is an irreducible cubic form, Greaves [1] showed that there exists constants with depending only on , such that
[TABLE]
holds for any . If is an irreducible quartic form, Daniel [2] showed that
[TABLE]
where is a constant depending only on . For more related works, see e.g. la Bretèche, Browning [3] and Browning[4]. However, if , this kind of problems will become more complicated. There are few results in this direction. For , Friedlander and Iwaniec [5] showed that
[TABLE]
where is a constant and means that . If is a positive definite quadratic form with variables, then it is easy to obtain the sum
[TABLE]
by classical results of quadratic form, where . For example, Yu [6] obtained the following
[TABLE]
Sun and Zhang [7] obtained the following
[TABLE]
where are constants and is an arbitrarily positive number. However this method does not working if is an indefinite quadratic form. On the other hand, nothing of the following sum
[TABLE]
is known for and quadratic form is positive definite or indefinite.
The purpose of this paper is to investigate general problem as above. More precisely, let be a quadratic polynomial with variables and integer coefficients. The vector and denote as a box for some sufficiently large positive number . Also assume quadratic polynomial satisfies
[TABLE]
where is an matrix with entries , vector , and suppose those coefficients satisfy the following
[TABLE]
Thus has a maximum value in the box when is sufficiently large, say
[TABLE]
Our main result is the following.
Theorem 1.1**.**
Let , be defined as above, and . For any there exist constants , ,…, and , such that
[TABLE]
and
[TABLE]
where the function is given in Lemma 4.1.
Notation
The symbols , and denote the positive integers, the integers and the real numbers, respectively. , the letter always denotes a prime, is transpose operation of matrix . The symbol represents shorthand for the groups . Also, the shorthand for the multiplicative group reduced residue classes is . Occasionally we make use of the -convention: whenever appears in a statement, it is asserted that the statement is true for all real . This allows us to write , for example.
2. Primaries
The primary technique used in the proof of the main theorem is the circle method. We shall need the following results which need in the sequel. Lemma 2.4, Lemma 2.5 and Lemma 2.6 will be used in the estimates of the major arcs of the circle method. Lemma 2.8 will be used in the estimate of the minor arcs. To obtain Lemma 2.4, we firstly need the follows lemma.
Lemma 2.1** (R. A. Smith).**
Let , . Then for , we have
[TABLE]
where
[TABLE]
with
[TABLE]
Proof.
This lemma is essentially made by Smith [8], and we just change the form as needed. Firstly, by the equation (30) of [8], we get
[TABLE]
where the notations be followed. Theorem 3 of this paper yields
[TABLE]
where
[TABLE]
and
[TABLE]
By the definition of , namely (13),(21) and relatively talking about (21) of [8]. It is easily seen that
[TABLE]
Hence we obtain that
[TABLE]
where
[TABLE]
Smith [8] conjectured the validity of the estimate for any and proved by Matsumoto [9]. Which implies the bound
[TABLE]
This completes the proof of the lemma. ∎
We have the proposition which will be used in the proof of Lemma 2.4.
Proposition 2.2**.**
Let be an integer, and denote . Also let be defined as in Lemma 2.1. Define
[TABLE]
Then is independent of and we may write it as . Furthermore, is multiplicative function and
[TABLE]
holds for any integer .
Proof.
First, we have
[TABLE]
where is the Ramanujan’s sum and the fact that if then be used. This result yields independent on . Suppose that positive integers and are coprime, then
[TABLE]
hence we just need to show
[TABLE]
whenever and . It is obtained by the definition of , say
[TABLE]
Furthermore,
[TABLE]
where . It is easily seen that if with , then
[TABLE]
Thus we have
[TABLE]
On the other hand
[TABLE]
Therefore
[TABLE]
It is obviously that is analytic in for every which concerned. Hence one can use Cauchy estimate, say
[TABLE]
where . Hence combining with (2.2), we obtain that
[TABLE]
Thus complete the proof of the lemma. ∎
To apply the circle method, we need the following propositions.
Proposition 2.3**.**
Let with be an positive integer and . Define
[TABLE]
Then
[TABLE]
where defined as Proposition 2.2.
Proof.
First, by Proposition 2.3 we have
[TABLE]
On the other hand,
[TABLE]
where and using Proposition 2.2 we complete the proof of the lemma. ∎
The Riemann zeta function is meromorphic with a single pole of order one at . It can therefore be expanded as a Laurent series about , say
[TABLE]
where
[TABLE]
are the Stieltjes constants. Therefore there exists constants , ,…, and a holomorphic function on such that
[TABLE]
Furthermore, we obtain that
[TABLE]
for any , where is a holomorphic function on about . On the other hand, we also have a Taylor series for at , say
[TABLE]
Therefore the residue of at is
[TABLE]
We Define
[TABLE]
Then by Proposition 2.2 we have and the results of Proposition 2.3 rewritten as
Lemma 2.4**.**
Let with be an positive integer and . Then, we have
[TABLE]
where
[TABLE]
with
[TABLE]
and where defined by (2.1).
The following lemmas will be used in the estimate of the major arcs of the circle method.
Lemma 2.5**.**
Let with be an positive integer and . Define
[TABLE]
Then
[TABLE]
where
[TABLE]
Proof.
Firstly,
[TABLE]
We shall prove
[TABLE]
which immediately yields the proof. For any with and , let us consider the follows estimate
[TABLE]
which obtained by partial integration directly. So above applied successively for each variables yields (2.7). ∎
Lemma 2.6**.**
Let be defined as in Lemma 2.5 with . Then for any be defined as above, we have
[TABLE]
Proof.
Firstly,
[TABLE]
It is easily seen that
[TABLE]
Hence we deduce that
[TABLE]
Since is nonsingular, hence
[TABLE]
This completes the proof. ∎
To give a good estimate for in the minor arcs of the circle method, we need the following lemmas.
Lemma 2.7**.**
Let be a nonsingular matrix with column vectors . Also let let with be an positive integer, and . Define
[TABLE]
where . Then
[TABLE]
Proof.
Firstly we have
[TABLE]
For the inner sum above
[TABLE]
notes that , then
[TABLE]
On the other hand, for each , there exists some and uniquely such that
[TABLE]
namely
[TABLE]
In this case, it has uniformly for all , which implies the number of integers on above interval bounded by . For each , let be an integer of above interval. If there exists an such that for all , namely
[TABLE]
then and nonsingular implies
[TABLE]
Hence the number of satisfying (2.10) be bounded by . Furthermore, for all , the number of satisfy the condition
[TABLE]
bounded by . On the other hand if and only if
[TABLE]
Hence for all , the number of satisfying by bounded by .
For the convenience of discussion, , we denote
[TABLE]
and
[TABLE]
Then
[TABLE]
Thus the sum (2.8) can be rewritten as
[TABLE]
Therefore we obtain that
[TABLE]
which completes the proof of the lemma. ∎
By this lemma, we have a nontrivial estimate for as follows.
Lemma 2.8**.**
Let defined by (1.2) and (1.3). Also let let with be an positive integer, and . Then, we have
[TABLE]
Proof.
First of all, we have that
[TABLE]
Now we write the symmetric matrix . Then, using the fact that
[TABLE]
we obtain that
[TABLE]
Using the same method as in the proof of Lemma 2.8, we can derive that
[TABLE]
This completes the proof of the lemma. ∎
3. Singular integral
The well known results says that the gaussian integral
[TABLE]
converges if is a symmetric complex matrix with the real part of is non-negative and no eigenvalue of vanishes. Hence we obtain that
[TABLE]
where is general symbol function and . We have the following lemma.
Lemma 3.1**.**
We have
[TABLE]
Proof.
Firstly, we have
[TABLE]
where . If , using (3) then
[TABLE]
The above result implies that
[TABLE]
On the other hand,
[TABLE]
where we have used the fact: . Note that
[TABLE]
then part integration yields
[TABLE]
Together with (3.2) and above, we get the proof the lemma. ∎
4. The proof of main theorem
Here we refer the methods of Pleasants [10] to deal with the minor arcs. Firstly, let and define
[TABLE]
It is obviously that,
[TABLE]
and when by well know Dirichlet’s approximation theorem. If we define
[TABLE]
for , then for all one has
[TABLE]
We take as the major arcs, and the minor arcs is . As we all know, is the union of all disjoint small intervals with and , where . Thus we have
[TABLE]
for all and . Therefore
[TABLE]
Applying the Cauchy-Schwarz inequality give an estimate for the minor arcs integral as follows
[TABLE]
where is the Lebesgue measure of the set . By (4.1) one has
[TABLE]
For , notes that and Lemma 2.8 one has
[TABLE]
Hence by (4.3), (4.4) and implies
[TABLE]
On the other hand
[TABLE]
hence together it with (4) and (4) we obtain that
[TABLE]
For the major arc, by Lemma 2.4 and Lemma 2.5, we have
[TABLE]
Note that Lemma 2.6 and , we obtain that
[TABLE]
where
[TABLE]
On the other hand, by Lemma 3.1 we have
[TABLE]
where
[TABLE]
It is easily seen that when , one has the optimal estimate
[TABLE]
We define
[TABLE]
then combine Lemma 2.4 and (4.8) we obtain that
[TABLE]
We next try to give an explicit expression for .
Lemma 4.1**.**
The function has the Euler product as follows
[TABLE]
where
[TABLE]
[TABLE]
for and
[TABLE]
Proof.
It is easily seen that
[TABLE]
is real and multiplicative. When is a prime power with integer . It is easily seen that
[TABLE]
On the other hand, by Lemma 2.2 we shown that is also multiplicative. Thus above implies the Euler product of . Applying Lemma 2.1 and Proposition 2.2, we show that
[TABLE]
For the first term above, denote by
[TABLE]
Then clearly for ,
[TABLE]
[TABLE]
Hence
[TABLE]
∎
Combining above estimates and calculations, we obtain the proof of the main theorem.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Greaves. On the divisor-sum problem for binary cubic forms. Acta Arith. , 17:1–28, 1970.
- 2[2] Stephan Daniel. On the divisor-sum problem for binary forms. J. Reine Angew. Math. , 507:107–129, 1999.
- 3[3] R. de la Bretèche and T. D. Browning. Le problème des diviseurs pour des formes binaires de degré 4. J. Reine Angew. Math. , 646:1–44, 2010.
- 4[4] Tim Browning. The divisor problem for binary cubic forms. J. Théor. Nombres Bordeaux , 23(3):579–602, 2011.
- 5[5] J. B. Friedlander and H. Iwaniec. A polynomial divisor problem. J. Reine Angew. Math. , 601:109–137, 2006.
- 6[6] Gang Yu. On the number of divisors of the quadratic form m 2 + n 2 superscript 𝑚 2 superscript 𝑛 2 m^{2}+n^{2} . Canad. Math. Bull. , 43(2):239–256, 2000.
- 7[7] Qingfeng Sun and Deyu Zhang. Sums of the triple divisor function over values of a ternary quadratic form. J. Number Theory , 168:215–246, 2016.
- 8[8] Robert A. Smith. The generalized divisor problem over arithmetic progressions. Math. Ann. , 260(2):255–268, 1982.
