The author is supported by NSF GRFP grant DGE-1656518 as well as the NSF Mathematical Sciences Research Program through the grant DMS-2202128, and would like to thank Kannan Soundararajan for many helpful comments and discussions.
1. Introduction
The Hardy–Littlewood -tuples conjectures, and the constants known as singular series that appear within them, have long been studied in connection to the distribution of primes. These conjectures state that for any -tuple of distinct integers, the number of -tuples of primes of the form , with , is given by
(1) |
|
|
|
where is the singular series
(2) |
|
|
|
and denotes the number of distinct residue classes modulo occupied by the elements of .
In [1], Gallagher showed that the Hardy–Littlewood conjectures imply that the distribution of primes in intervals of size is Poissonian for fixed , by showing that the singular series is on average. In particular, he showed that for any fixed ,
|
|
|
In 2004, Montgomery and Soundararajan [7]
used a more refined estimate of sums of singular series to show that when is in a larger regime, with but , the Hardy–Littlewood conjectures imply that the distribution of primes, counted with von Mangoldt weights, becomes Gaussian with mean and variance , matching numerical data. Instead of the singular series itself, they considered alternating sums of singular series, defining These sums have the effect of subtracting the main term from the outset, making it easier to understand lower-order contributions. The analogous Hardy–Littlewood conjecture says that
|
|
|
so that each term on the left-hand side has expectation .
Montgomery and Soundararajan [7] showed that for fixed ,
(3) |
|
|
|
where if is even, and if is odd, and , with the Euler–Mascheroni constant. Their results depend crucially on work of Montgomery and Vaughan [8]
on the distribution of reduced residues mod in short intervals.
Here we develop analogs of the work of Montgomery and Vaughan as well as that of Montgomery and Soundararajan by studying sums of singular series with added conditions on the set . First, instead of summing over all subsets of , we restrict to sets whose elements lie in arithmetic progressions. For a fixed modulus and congruence classes mod , we study the sum
(4) |
|
|
|
where and is the singular series of away from , given by
(5) |
|
|
|
The study of these sums is of interest for two reasons. First, they appear in the work of Lemke Oliver and Soundararajan in [5] on bias in the distribution of consecutive primes in arithmetic progressions. Specifically, Lemke Oliver and Soundararajan conjecture that if is defined as the number of primes with and , then
|
|
|
where , is a constant defined only in terms of and , and
|
|
|
They proceed to heuristically estimate , and thus , by estimating a weighted version of . Our results generalize these arguments by estimating for all , which is necessary for understanding some of the error terms appearing in Lemke Oliver and Soundararajan’s heuristic. Secondly, restricting sums of singular series in this manner may shed light on other questions about sums of singular series. We show in Theorem 1.2 that the asymptotics for (4) are governed by incidences among the ’s mod . As discussed in [4], we do not yet know the asymptotic average size of sums of when is odd. The results of these more refined averages of singular series may clarify where the main term should be coming from for sums of singular series with an odd number of terms.
The sums over admit the expansion
|
|
|
Following [7] and [8], we first consider a related quantity, where the summands are restricted to divide a secondary modulus and the ’s are not necessarily distinct, to get
(6) |
|
|
|
where for ,
(7) |
|
|
|
In order to state our result, we will need to fix some notation concerning perfect matchings of . For , a perfect matching of is a set of unordered pairs in so that each element is paired with exactly one other element, i.e. each appears in exactly one pair , and . Since each pair is unordered, we will generally choose to write the representative with , so that with . Let denote the set of perfect matchings of , so that
(8) |
|
|
|
Note that when is odd, . Moreover, for a set of integers , we will denote by the set of matchings of into pairs, so that .
In Section 2, we prove the following result, which mirrors Theorem 1 of [7].
Theorem 1.1.
Fix a modulus , an integer , and congruence classes modulo . Define as in (8). Let be a squarefree integer with , and define as in (6). For ,
|
|
|
In order to state our main result on the asymptotics of , we define some further notation.
For , define
|
|
|
Note that some of the sets may be empty, and that .
We will say that a partition of refines if for each , there exists some with ; note that is then unique. For such a partition, write and define to be the value with .
Theorem 1.2.
Fix a modulus and an integer , as well as congruence classes modulo . Define by (4). Then for ,
|
|
|
|
(9) |
|
|
|
|
In particular, if is the number of ways to pair the ’s such that every pair has equal values, then
|
|
|
The framework of Theorems 1.1 and 1.2 also applies to sums of singular series weighted by smooth functions. Let be functions with compact supports contained in and such that , where the Fourier transform is defined as
|
|
|
For , we are interested in the quantity
(10) |
|
|
|
The size of as is similar in structure to the analogous result for sums of singular series along arithmetic progressions: the main term is a sum over perfect matchings of , and for each matching the contribution is determined by interactions of and for each pair .
We set some notation before stating our results.
Define
(11) |
|
|
|
where for and smooth, with compact support, and such that ,
(12) |
|
|
|
Since is smooth, is a smoother indicator function of values of that are close to . In particular, by Poisson summation,
|
|
|
By assumption, . For any real number , only one value of will be in the interval ; let denote this value, so that is the representative of satisfying . Then
(13) |
|
|
|
The following results about hold, analogous to Theorem 1.1 and Lemma 3.2.
Theorem 1.3.
Fix and smooth functions with compact supports and such that for all . Define as in (8). Let be a squarefree integer, and define as in (11). For ,
|
|
|
Lemma 1.4.
Fix and let be smooth functions with compact supports such that . Define , and define via (11). Then
(14) |
|
|
|
where is the Mellin transform of , defined by
(15) |
|
|
|
Using precisely the same techniques as in the case of arithmetic progressions, an analog to Theorem 1.2 also holds for the smooth functions setting, where the input to each summand is clarified by Lemma 1.4.
Theorem 1.5.
Fix an integer and smooth functions with compact support such that and such that for each . Define via (10). Then for ,
|
|
|
|
(16) |
|
|
|
|
where the sum is taken over partitions of where each part has either or elements, and for , denotes where .
The proofs of Theorems 1.3 and 1.5 are identical to the proofs of Theorems 1.1 and 1.2, so we omit them. However, Theorems 1.3 and 1.1, which provide asymptotics for in the cases of smooth weighting and arithmetic progressions, rely on lemmas about sums of . The results are fundamentally the same, but the flavor of several of these lemmas is somewhat different in the smooth case, so we record them in Section 5. We also provide the proof of Lemma 1.4, which is similar to the proof of Lemma 3.2.
The organization of this paper is as follows. In Section 2, we prove Theorem 1.1. In Section 3, we compute certain sums of 2-term singular series which will then be used in the proof of Theorem 1.2. In Section 4, we prove Theorem 1.2. Finally, in Section 5 we discuss the smooth case.
2. Proof of Theorem 1.1
The arguments in this section closely follow the arguments in the proof of Lemma 8 in [8] and Theorem 1 in [7]. Here we outline the argument; where it differs, we present detailed explanations, but many steps are cited to [8] and [7].
The functions , defined in (7), are modular versions of sums . The sums are large if is close to an integer and otherwise exhibit large amounts of cancellation. Since is summed only over in a set congruence class modulo , it will also take large values when is close to a multiple of . For any , write
|
|
|
|
|
|
|
|
so that
|
|
|
Define
(17) |
|
|
|
so that
We can then closely follow the analysis of Montgomery and Vaughan in [8] and Montgomery and Soundararajan in [7].
In particular, can be bounded, up to some dependence on , by the same bounds as appear in Lemmas 4,5,6, and 7 of [8] and using the same arguments. We arrive at the following result.
Theorem 2.1.
Fix . Let denote the set of -tuples such that for all , , , and the ’s are not equal in pairs and otherwise distinct; that is to say, there is no reordering permutation of the indices with for all , and no other equalities. Then
|
|
|
Theorem 2.1 accounts for all terms in except for those terms where the ’s are equal in pairs and otherwise distinct. When is odd, there are no such terms, so assume that is even. By the same argument as in [7], we can drop the assumption that the pairs are distinct, so that the terms left to be estimated are given by
|
|
|
where for each ,
|
|
|
Each term in our sum is identical up to changing labels, so without loss of generality we will work with the term , so that for all . This term is given by
(18) |
|
|
|
Let be the subset of ’s with instead of . For , we have
|
|
|
which, when summed over with the weight , is equal to . Thus, (18) is equal to
(19) |
|
|
|
where
|
|
|
The term gives the desired main term, so it remains to show that the terms with are smaller. By following the reasoning on page 11 of [7], we get that
|
|
|
and that for any ,
|
|
|
Applying these estimates to (19) completes the proof of Theorem 1.1.
4. Proof of Theorem 1.2
Throughout this section, fix and set , where .
Begin with the expansion
(24) |
|
|
|
where the error term is due to our choice of . The expression on the right-hand side of (24) is very close to , but in order to apply Theorem 1.1, we will need to remove the distinctness condition on the ’s. As in the proof of Theorem 2 from [7], removing this condition will be the bulk of our work.
This distinctness condition is heavily dependent on the congruence classes ; in particular, if , then and never coincide and the distinctness condition is immaterial. Our arguments follow those of [7] closely, but with additional bookkeeping in order to account for the congruence classes .
For a given tuple with and for all , put if and otherwise. Then
|
|
|
When the left-hand side above is expanded, it is a linear combination of products of the symbols. Let denote one such product, and let denote the number of in the product. As in [7], define an equivalence relation on these -products by setting if and have the same value for all choices of ’s; for example,
Recall that a partition of refines if for each , there exists some with ; note that is then unique. For such a partition, write and define to be the value with . Given a partition refining , let
|
|
|
Every equivalence class of -products contains a unique , where the condition that refines corresponds precisely to the fact that we are only considering when . Equivalence classes of -products are thus in bijection with partitions of that refine . For a partition , put
|
|
|
so that
|
|
|
and the sum over ’s in (24) is equal to
|
|
|
By the same reasoning as in [7], the contribution to from terms where for some is , so that
|
|
|
|
(25) |
|
|
|
|
Suppose that consists of doubleton sets and singleton sets . Note that the number of these partitions depends on the partition , because of the constraint that . The term in corresponding to a fixed such partition is
(26) |
|
|
|
where we are slightly abusing notation in the final product by identifying the singletons with their unique element.
For , define and by the relations
|
|
|
and define
|
|
|
Then (26) is equal to
(27) |
|
|
|
Now separate the indices with . To do so, let . We can again rewrite (27) as
(28) |
|
|
|
where
|
|
|
Note that .
By precisely the same arguments as in [7], the contributions when can be absorbed into the error term. Moreover,
|
|
|
|
|
|
|
|
Thus the expression (28) is equal to
|
|
|
Inserting this back into (25) yields
|
|
|
|
|
|
We are finally prepared to appeal to Theorem 1.1. If is odd, then so is , so there is no main term. Suppose that is even. Recall that denotes the set of perfect matchings of the set . Then the main term is
(29) |
|
|
|
which proves the first claim in Theorem 1.2.
By Lemma 3.2, unless . So, the largest term comes from those with for all . Note that the error term is then quite large; it is only smaller by a factor of .
If there exists some with for all , then it must be that is even for all . Moreover, each term in this sum corresponds to a perfect pairing of such that for each pair , ; either two indices are paired by lying in the same , or by lying in the same element of . The choice of then corresponds to choosing of these pairs. Note also that for any , which allows us to simplify the main term in this case to get
|
|
|
where is the number of ways to pair the ’s such that every pair has equal values. By the binomial theorem, this is
|
|
|
By Lemma 3.2, this is
|
|
|
for defined in (21), which gives the result.