Updates on my research & expository papers, discussion of xuất hiện problems, and other maths-related topics. By Terence Tao


Higher uniformity of arithmetic functions in short intervals I. Allintervals


Kaisa Matomäki, Xuancheng Shao, Joni Teräväinen, & myself have just uploaded to the arXiv our preprint “Higher uniformity of arithmetic functions in short intervals I. All intervals“. This paper investigates the higher order (Gowers) uniformity of standard arithmetic functions in analytic number theory (and specifically, the Möbius function

*
, the von Mangoldt function
*
, & the generalised divisor functions
*
) in short intervals
*
}" class="latex" />, where
*
is large và
*
lies in the range
*
for a fixed constant
*
was “major arc”, together with an error term. We found it convenient to lớn cancel off such main terms by subtracting an approximant
*
from each of the arithmetic functions
*
and then getting upper bounds on remainder correlations such as

*
(actually for technical reasons we also allow the
*
variable to lớn be restricted further to lớn a subprogression of
*
}" class="latex" />, but let us ignore this minor extension for this discussion). There is some flexibility in how to choose these approximants, but we eventually found it convenient lớn use the following choices.

Bạn đang xem: Terence tao

For the von Mangoldt function
*
, we eventually went with the Cramér-Granville approximant
*
, where
*
, we used a somewhat complicated-looking approximant
*
for some explicit polynomials
*
, chosen so that
*
*
have almost exactly the same sums along arithmetic progressions (see the paper for details).

The objective is then khổng lồ obtain bounds on sums such as (1) that improve upon the “trivial bound” that one can get with the triangle inequality & standard number theory bounds such as the Brun-Titchmarsh inequality. For

*
and
*
, the Siegel-Walfisz theorem suggests that it is reasonable to expect error terms that have “strongly logarithmic savings” in the sense that they gain a factor of
*
over the trivial bound for any
*
0}" class="latex" />; for
*
, the Dirichlet hyperbola method suggests instead that one has “power savings” in that one should gain a factor of
*
over the trivial bound for some
*
0}" class="latex" />. In the case of the Möbius function
*
, there is an additional trick (introduced by Matomäki and Teräväinen) that allows one to lower the exponent
*
somewhat at the cost of only obtaining “weakly logarithmic savings” of shape
*
for some small
*
0}" class="latex" />.

Our main estimates on sums of the khung (1) work in the following ranges:

For
*
, one can obtain weakly logarithmic savings for
*
. For
*
, one can obtain power nguồn savings for
*
. For
*
, one can obtain power savings for
*
.

Conjecturally, one should be able to obtain power savings in all cases, & lower

*
down to zero, but the ranges of exponents và savings given here seem to be the limit of current methods unless one assumes additional hypotheses, such as GRH. The
*
result for correlation against Fourier phases
*
was established previously by Zhan, & the
*
result for such phases và
*
was established previously by by Matomäki and Teräväinen.

By combining these results with tools from additive combinatorics, one can obtain a number of applications:

We now briefly discuss some of the ingredients of proof of our main results. The first step is standard, using combinatorial decompositions (based on the Heath-Brown identity và (for the

*
result) the Ramaré identity) lớn decompose
*
into more tractable sums of the following types:

Type
*
sums
, which are basically of the size
*
for some weights
*
of controlled size and some cutoff
*
that is not too large; Type
*
sums
, which are basically of the khung
*
for some weights
*
,
*
of controlled kích cỡ and some cutoffs
*
that are not too close lớn
*
or to
*
; Type
*
sums
, which are basically of the form
*
for some weights
*
of controlled form size and some cutoff
*
that is not too large.

The precise ranges of the cutoffs

*
depend on the choice of
*
; our methods fail once these cutoffs pass a certain threshold, and this is the reason for the exponents
*
being what they are in our main results.

The Type

*
sums involving nilsequences can be treated by methods similar khổng lồ those in this previous paper of Ben Green và myself; the main innovations are in the treatment of the Type
*
& Type
*
sums.

For the Type

*
sums, one can split into the “abelian” case in which (after some Fourier decomposition) the nilsequence
*
is basically of the size
*
, và the “non-abelian” case in which
*
is non-abelian &
*
exhibits non-trivial oscillation in a central direction. In the abelian case we can adapt arguments of Matomaki & Shao, which uses Cauchy-Schwarz và the equidistribution properties of polynomials to lớn obtain good bounds unless
*
is “major arc” in the sense that it resembles (or “pretends to be”)
*
for some Dirichlet character
*
and some frequency
*
, but in this case one can use classical multiplicative methods to lớn control the correlation. It turns out that the non-abelian case can be treated similarly. After applying Cauchy-Schwarz, one ends up analyzing the equidistribution of the four-variable polynomial sequence

*

as
*
range in various dyadic intervals. Using the known multidimensional equidistribution theory of polynomial maps in nilmanifolds, one can eventually show in the non-abelian case that this sequence either has enough equidistribution khổng lồ give cancellation, or else the nilsequence involved can be replaced with one from a lower dimensional nilmanifold, in which case one can apply an induction hypothesis.

For the type

*
sum, a model sum lớn study is

*
exponent for our
*
result can be as low as
*
.

Xem thêm: Top 9 Ví Dụ Về Quan Hệ Công Chúng Của Vinamilk Archives, Chiến Dịch Pr Vinamilk 40 Năm Vươn Cao Việt Nam

In a sequel to lớn this paper (currently in preparation), we will obtain analogous results for almost all intervals

*
}" class="latex" /> with
*
in the range
*
}" class="latex" />, in which we will be able lớn lower
*
all the way to lớn
*
.