# Dispersion method

in number theory

A method for solving certain binary equations (binary additive problems) of the form

$$\label{eq1} \alpha+\beta = n,$$

where $\alpha$ and $\beta$ belong to sequences of natural numbers which are sufficiently dense and sufficiently well distributed in the sequence of natural numbers.

The method, which was developed by Yu.V. Linnik in 1958–1961 and is therefore also known as Linnik's dispersion method, combines elementary concepts of probability theory (in particular, the concept of dispersion and Chebyshev-type inequalities) with the analytic and algebraic ideas of I.M. Vinogradov and A. Weil. It may be described as follows (see also Additive number theory).

Equation \eqref{eq1} may be reduced to equations of the form

$$\label{eq2}\nu D'+\beta=n;$$

where $\nu$ and $D'$ run, independently of each other, through certain values from a rectangular domain $\nu\in(\nu)$, $D'\in (D)$, where $(\nu)$ and $(D)$ are certain intervals; moreover, the numbers $\nu$ are prime, while various additional conditions may be imposed on $D'$. Let $F$ be the number of solutions of this equation.

Now consider the equation

$\nu D+\beta=n$

for an arbitrary $D\in(D)$, and let $A(n,D)$ be the number of its solutions found by some heuristic means. The (hypothetical) number of expected solutions of equation \eqref{eq2} is then written in the form

$S=\sum_{D'\in (D)}A(n,D').$

An estimate of the difference $F-S=V$ has the form

$$\label{eq3}V=\sum_{D'\in (D)}\left(\sum_{\nu D'+\beta=n} 1-A(n,D')\right).$$

An application of the Cauchy inequality yields

$$\label{eq4} V^2\leq D_0V',$$

where $D_0$ is the length of the interval $(D)$ and

$$\label{eq5} V'=\sum_{D'\in(D)}\left(\sum_{\nu D'+\beta=n}1-A(n,D')\right)^2$$

is the dispersion of the number of solutions of equation \eqref{eq2}.

If the summation in \eqref{eq5} is extended over all $D\in(D)$, all additional conditions imposed on $D'$ in \eqref{eq2} are dropped. At the same time the value of the dispersion can only increase; accordingly,

$V'\leq \sum_{D\in (D)} \left(\sum_{\nu D+\beta=n}1-A(n,D)\right)^2=\Sigma_1-2\Sigma_2+\Sigma_3.$

The sums $\Sigma_1$, $\Sigma_2$ and $\Sigma_3$ can be computed asymptotically in certain cases. The computation of $\Sigma_1$, which is the basic sum in the dispersion method, is the most difficult. The asymptotic computation of $\Sigma_1$ is effected using the Vinogradov method by computing, for certain functions, the number of fractional parts comprised in the given segment, and also by using the most recent estimates for trigonometric sums obtained by methods of algebraic geometry. Asymptotics for the sums $\Sigma_2$ and $\Sigma_3$ are found by elementary summations. If, as a result, the dispersion is found to be not too large, \eqref{eq3} and \eqref{eq4} yield an asymptotic expansion for the number of solutions of equation \eqref{eq2}.

Combining the numbers of solutions of all equations of the type \eqref{eq2} yields an asymptotic formula for the number of solutions of equation \eqref{eq1}.

The above scheme of the dispersion method may be used also to solve equations of the type

$\alpha-\beta=l,$

where $l$ is a given non-zero integer.

Linnik, et al. (see [Br]) employed this method to solve a number of classical additive problems which, prior to the genesis of the dispersion method, could only be solved on the strength of heuristic or hypothetical conceptions. Such problems include the additive divisor problem ($\alpha=x_1,\ldots,x_k$, $k=\textrm{const}$, $\beta=xy$); the Titchmarsh problem on divisors ($\alpha=p$ is a prime, $\beta=xy$); and the Hardy–Littlewood problem ($\alpha=p$ is a prime, $\beta=x^2+y^2$).

The dispersion method also yielded solutions of certain analogues and generalizations of these problems; this includes, in particular, an asymptotic expansion for the number of solutions of the general Hardy–Littlewood equation

$p+\phi(\xi,\eta)=n,$

where $p$ is a prime number and $\phi(\xi,\eta)$ is a given primitive positive-definite quadratic form. The existence of an infinite set of prime numbers of the type

$p=\phi(\xi,\eta)+l,$

where $l$ is an arbitrary fixed integer, was proved.

The domain of application of the dispersion method intersects with that of Linnik's large sieve method.

#### References

 [Br] B.M. Bredekhin, "The dispersion method and definite binary additive problems" Russian Math. Surveys , 20 : 2 (1965) pp. 85–125 Uspekhi Mat. Nauk , 20 : 2 (1965) pp. 89–130 [BrLi] B.M. Bredekhin, Yu.V. Linnik, "A new method in analytic number theory" , Current problems in analytic number theory , Minsk (1974) pp. 5–22 (In Russian) MR337854 [Li] Yu.V. Linnik, "The dispersion method in binary additive problems" , Amer. Math. Soc. (1963) (Translated from Russian) MR0168543 Zbl 0112.27402 [Pr] K. Prachar, "Primzahlverteilung" , Springer (1957) MR0087685 Zbl 0080.25901
How to Cite This Entry:
Dispersion method. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Dispersion_method&oldid=29846
This article was adapted from an original article by B.M. Bredikhin (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article