fbpx
Wikipedia

Anatoly Karatsuba

Anatoly Alexeyevich Karatsuba (his first name often spelled Anatolii) (Russian: Анато́лий Алексе́евич Карацу́ба; Grozny, Soviet Union, 31 January 1937 – Moscow, Russia, 28 September 2008[1]) was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

Anatoly Alexeyevich Karatsuba
Born(1937-01-31)31 January 1937
Died28 September 2008(2008-09-28) (aged 71)
NationalityRussian
Alma materMoscow State University
Scientific career
FieldsMathematician
Doctoral advisorN. M. Korobov

For most of his student and professional life he was associated with the Faculty of Mechanics and Mathematics of Moscow State University, defending a D.Sc. there entitled "The method of trigonometric sums and intermediate value theorems" in 1966.[2] He later held a position at the Steklov Institute of Mathematics of the Academy of Sciences.[2]

His textbook Foundations of Analytic Number Theory went to two editions, 1975 and 1983.[2]

The Karatsuba algorithm is the earliest known divide and conquer algorithm for multiplication and lives on as a special case of its direct generalization, the Toom–Cook algorithm.[3]

The main research works of Anatoly Karatsuba were published in more than 160 research papers and monographs.[4]

His daughter, Yekaterina Karatsuba, also a mathematician, constructed the FEE method.

Work on informatics edit

As a student of Lomonosov Moscow State University, Karatsuba attended the seminar of Andrey Kolmogorov and found solutions to two problems set up by Kolmogorov. This was essential for the development of automata theory and started a new branch in Mathematics, the theory of fast algorithms.

Automata edit

In the paper of Edward F. Moore,[5]  , an automaton (or a machine)  , is defined as a device with   states,   input symbols and   output symbols. Nine theorems on the structure of   and experiments with   are proved. Later such   machines got the name of Moore machines. At the end of the paper, in the chapter «New problems», Moore formulates the problem of improving the estimates which he obtained in Theorems 8 and 9:

Theorem 8 (Moore). Given an arbitrary   machine  , such that every two states can be distinguished from each other, there exists an experiment of length   that identifies the state of   at the end of this experiment.

In 1957 Karatsuba proved two theorems which completely solved the Moore problem on improving the estimate of the length of experiment in his Theorem 8.

Theorem A (Karatsuba). If   is a   machine such that each two its states can be distinguished from each other then there exists a ramified experiment of length at most  , by means of which one can find the state   at the end of the experiment.
Theorem B (Karatsuba). There exists a   machine, every states of which can be distinguished from each other, such that the length of the shortest experiment finding the state of the machine at the end of the experiment, is equal to  .

These two theorems were proved by Karatsuba in his 4th year as a basis of his 4th year project; the corresponding paper was submitted to the journal "Uspekhi Mat. Nauk" on December 17, 1958 and published in June 1960.[6] Up to this day (2011) this result of Karatsuba that later acquired the title "the Moore-Karatsuba theorem", remains the only precise (the only precise non-linear order of the estimate) non-linear result both in the automata theory and in the similar problems of the theory of complexity of computations.

Work on number theory edit

The main research works of A. A. Karatsuba were published in more than 160 research papers and monographs.[7][8] [9] [10]

The p-adic method edit

A.A.Karatsuba constructed a new  -adic method in the theory of trigonometric sums.[11] The estimates of so-called  -sums of the form

 

led[12] to the new bounds for zeros of the Dirichlet  -series modulo a power of a prime number, to the asymptotic formula for the number of Waring congruence of the form

 

to a solution of the problem of distribution of fractional parts of a polynomial with integer coefficients modulo  . A.A. Karatsuba was the first to realize[13] in the  -adic form the «embedding principle» of Euler-Vinogradov and to compute a  -adic analog of Vinogradov  -numbers when estimating the number of solutions of a congruence of the Waring type.

Assume that :   and moreover :   where   is a prime number. Karatsuba proved that in that case for any natural number   there exists a   such that for any   every natural number   can be represented in the form (1) for  , and for   there exist   such that the congruence (1) has no solutions.

This new approach, found by Karatsuba, led to a new  -adic proof of the Vinogradov mean value theorem, which plays the central part in the Vinogradov's method of trigonometric sums.

Another component of the  -adic method of A.A. Karatsuba is the transition from incomplete systems of equations to complete ones at the expense of the local  -adic change of unknowns.[14]

Let   be an arbitrary natural number,  . Determine an integer   by the inequalities  . Consider the system of equations

 
 

Karatsuba proved that the number of solutions   of this system of equations for   satisfies the estimate

 

For incomplete systems of equations, in which the variables run through numbers with small prime divisors, Karatsuba applied multiplicative translation of variables. This led to an essentially new estimate of trigonometric sums and a new mean value theorem for such systems of equations.

The Hua Luogeng problem on the convergency exponent of the singular integral in the Terry problem edit

 -adic method of A.A.Karatsuba includes the techniques of estimating the measure of the set of points with small values of functions in terms of the values of their parameters (coefficients etc.) and, conversely, the techniques of estimating those parameters in terms of the measure of this set in the real and  -adic metrics. This side of Karatsuba's method manifested itself especially clear in estimating trigonometric integrals, which led to the solution of the problem of Hua Luogeng. In 1979 Karatsuba, together with his students G.I. Arkhipov and V.N. Chubarikov obtained a complete solution[15] of the Hua Luogeng problem of finding the exponent of convergency of the integral:

 

where   is a fixed number.

In this case, the exponent of convergency means the value  , such that   converges for   and diverges for  , where   is arbitrarily small. It was shown that the integral   converges for   and diverges for  .

At the same time, the similar problem for the integral was solved:   where   are integers, satisfying the conditions :  

Karatsuba and his students proved that the integral   converges, if   and diverges, if  .

The integrals   and   arise in the studying of the so-called Prouhet–Tarry–Escott problem. Karatsuba and his students obtained a series of new results connected with the multi-dimensional analog of the Tarry problem. In particular, they proved that if   is a polynomial in   variables ( ) of the form :   with the zero free term,  ,   is the  -dimensional vector, consisting of the coefficients of  , then the integral :   converges for  , where   is the highest of the numbers  . This result, being not a final one, generated a new area in the theory of trigonometric integrals, connected with improving the bounds of the exponent of convergency   (I. A. Ikromov, M. A. Chahkiev and others).

Multiple trigonometric sums edit

In 1966–1980, Karatsuba developed[16][17] (with participation of his students G.I. Arkhipov and V.N. Chubarikov) the theory of multiple Hermann Weyl trigonometric sums, that is, the sums of the form

  , where   ,

  is a system of real coefficients  . The central point of that theory, as in the theory of the Vinogradov trigonometric sums, is the following mean value theorem.

Let   be natural numbers,  , . Furthermore, let   be the  -dimensional cube of the form ::   ,  , in the euclidean space : and ::   . : Then for any   and   the value   can be estimated as follows
  , :

where   ,  ,   ,  , and the natural numbers   are such that: ::   ,   .

The mean value theorem and the lemma on the multiplicity of intersection of multi-dimensional parallelepipeds form the basis of the estimate of a multiple trigonometric sum, that was obtained by Karatsuba (two-dimensional case was derived by G.I. Arkhipov[18]). Denoting by   the least common multiple of the numbers   with the condition  , for   the estimate holds

  ,

where   is the number of divisors of the integer  , and   is the number of distinct prime divisors of the number  .

The estimate of the Hardy function in the Waring problem edit

Applying his  -adic form of the Hardy-Littlewood-Ramanujan-Vinogradov method to estimating trigonometric sums, in which the summation is taken over numbers with small prime divisors, Karatsuba obtained[19] a new estimate of the well known Hardy function   in the Waring's problem (for  ):

 

Multi-dimensional analog of the Waring problem edit

In his subsequent investigation of the Waring problem Karatsuba obtained[20] the following two-dimensional generalization of that problem:

Consider the system of equations

  ,   ,

where   are given positive integers with the same order or growth,  , and   are unknowns, which are also positive integers. This system has solutions, if   , and if  , then there exist such  , that the system has no solutions.

The Artin problem of local representation of zero by a form edit

Emil Artin had posed the problem on the  -adic representation of zero by a form of arbitrary degree d. Artin initially conjectured a result, which would now be described as the p-adic field being a C2 field; in other words non-trivial representation of zero would occur if the number of variables was at least d2. This was shown not to be the case by an example of Guy Terjanian. Karatsuba showed that, in order to have a non-trivial representation of zero by a form, the number of variables should grow faster than polynomially in the degree d; this number in fact should have an almost exponential growth, depending on the degree. Karatsuba and his student Arkhipov proved,[21] that for any natural number   there exists  , such that for any   there is a form with integral coefficients   of degree smaller than  , the number of variables of which is  ,  ,

 

which has only trivial representation of zero in the 2-adic numbers. They also obtained a similar result for any odd prime modulus  .

Estimates of short Kloosterman sums edit

Karatsuba developed[22][23][24] (1993—1999) a new method of estimating short Kloosterman sums, that is, trigonometric sums of the form

 

where   runs through a set   of numbers, coprime to  , the number of elements   in which is essentially smaller than  , and the symbol   denotes the congruence class, inverse to   modulo  :  .

Up to the early 1990s, the estimates of this type were known, mainly, for sums in which the number of summands was higher than   (H. D. Kloosterman, I. M. Vinogradov, H. Salié, L. Carlitz, S. Uchiyama, A. Weil). The only exception was the special moduli of the form  , where   is a fixed prime and the exponent   increases to infinity (this case was studied by A. G. Postnikov by means of the method of Vinogradov). Karatsuba's method makes it possible to estimate Kloosterman sums where the number of summands does not exceed

 

and in some cases even

 

where   is an arbitrarily small fixed number. The final paper of Karatsuba on this subject[25] was published posthumously.

Various aspects of the method of Karatsuba have found applications in the following problems of analytic number theory:

  • finding asymptotics of the sums of fractional parts of the form :   : where   runs, one after another, through the integers satisfying the condition  , and   runs through the primes that do not divide the module   (Karatsuba);
  • finding a lower bound for the number of solutions of inequalities of the form :   : in the integers  ,  , coprime to  ,   (Karatsuba);
  • the precision of approximation of an arbitrary real number in the segment   by fractional parts of the form :

  : where  ,  ,   (Karatsuba);

  : where   is the number of primes  , not exceeding   and belonging to the arithmetic progression   (J. Friedlander, H. Iwaniec);

  • a lower bound for the greatest prime divisor of the product of numbers of the form :

 ,   (D. R. Heath-Brown);

  • proving that there are infinitely many primes of the form:

  (J. Friedlander, H. Iwaniec);

  • combinatorial properties of the set of numbers :

    (A. A. Glibichuk).

The Riemann zeta function edit

The Selberg zeroes edit

In 1984 Karatsuba proved,[26][27] that for a fixed   satisfying the condition  , a sufficiently large   and  ,  , the interval   contains at least   real zeros of the Riemann zeta function  .

The special case   was proven by Atle Selberg earlier in 1942.[28] The estimates of Atle Selberg and Karatsuba can not be improved in respect of the order of growth as  .

Distribution of zeros of the Riemann zeta function on the short intervals of the critical line edit

Karatsuba also obtained [29] a number of results about the distribution of zeros of   on «short» intervals of the critical line. He proved that an analog of the Selberg conjecture holds for «almost all» intervals  ,  , where   is an arbitrarily small fixed positive number. Karatsuba developed (1992) a new approach to investigating zeros of the Riemann zeta-function on «supershort» intervals of the critical line, that is, on the intervals  , the length   of which grows slower than any, even arbitrarily small degree  . In particular, he proved that for any given numbers  ,   satisfying the conditions   almost all intervals   for   contain at least   zeros of the function  . This estimate is quite close to the one that follows from the Riemann hypothesis.

Zeros of linear combinations of Dirichlet L-series edit

Karatsuba developed a new method [30][31] of investigating zeros of functions which can be represented as linear combinations of Dirichlet  -series. The simplest example of a function of that type is the Davenport-Heilbronn function, defined by the equality

 

where   is a non-principal character modulo   ( ,  ,  ,  ,  ,   for any  ),

 

For   Riemann hypothesis is not true, however, the critical line   contains, nevertheless, abnormally many zeros.

Karatsuba proved (1989) that the interval  ,  , contains at least

 

zeros of the function  . Similar results were obtained by Karatsuba also for linear combinations containing arbitrary (finite) number of summands; the degree exponent   is here replaced by a smaller number  , that depends only on the form of the linear combination.

The boundary of zeros of the zeta function and the multi-dimensional problem of Dirichlet divisors edit

 

To Karatsuba belongs a new breakthrough result [32] in the multi-dimensional problem of Dirichlet divisors, which is connected with finding the number   of solutions of the inequality   in the natural numbers   as  . For   there is an asymptotic formula of the form

  ,

where   is a polynomial of degree  , the coefficients of which depend on   and can be found explicitly and   is the remainder term, all known estimates of which (up to 1960) were of the form

  ,

where  ,   are some absolute positive constants.

Karatsuba obtained a more precise estimate of  , in which the value   was of order   and was decreasing much slower than   in the previous estimates. Karatsuba's estimate is uniform in   and  ; in particular, the value   may grow as   grows (as some power of the logarithm of  ). (A similar looking, but weaker result was obtained in 1960 by a German mathematician Richert, whose paper remained unknown to Soviet mathematicians at least until the mid-seventies.)

Proof of the estimate of   is based on a series of claims, essentially equivalent to the theorem on the boundary of zeros of the Riemann zeta function, obtained by the method of Vinogradov, that is, the theorem claiming that   has no zeros in the region

  .

Karatsuba found [33](2000) the backward relation of estimates of the values   with the behaviour of   near the line  . In particular, he proved that if   is an arbitrary non-increasing function satisfying the condition  , such that for all   the estimate

 

holds, then   has no zeros in the region

 

(  are some absolute constants).

Estimates from below of the maximum of the modulus of the zeta function in small regions of the critical domain and on small intervals of the critical line edit

Karatsuba introduced and studied [34] the functions   and  , defined by the equalities

 

Here   is a sufficiently large positive number,  ,  ,  ,  . Estimating the values   and   from below shows, how large (in modulus) values   can take on short intervals of the critical line or in small neighborhoods of points lying in the critical strip  . The case   was studied earlier by Ramachandra; the case  , where   is a sufficiently large constant, is trivial.

Karatsuba proved, in particular, that if the values   and   exceed certain sufficiently small constants, then the estimates

 

hold, where   are certain absolute constants.

Behaviour of the argument of the zeta-function on the critical line edit

Karatsuba obtained a number of new results[35][36] related to the behaviour of the function  , which is called the argument of Riemann zeta function on the critical line (here   is the increment of an arbitrary continuous branch of   along the broken line joining the points   and  ). Among those results are the mean value theorems for the function   and its first integral   on intervals of the real line, and also the theorem claiming that every interval   for   contains at least

 

points where the function   changes sign. Earlier similar results were obtained by Atle Selberg for the case  .

The Dirichlet characters edit

Estimates of short sums of characters in finite fields edit

In the end of the sixties Karatsuba, estimating short sums of Dirichlet characters, developed [37] a new method, making it possible to obtain non-trivial estimates of short sums of characters in finite fields. Let   be a fixed integer,   a polynomial, irreducible over the field   of rational numbers,   a root of the equation  ,   the corresponding extension of the field  ,   a basis of  ,  ,  ,  . Furthermore, let   be a sufficiently large prime, such that   is irreducible modulo  ,   the Galois field with a basis  ,   a non-principal Dirichlet character of the field  . Finally, let   be some nonnegative integers,   the set of elements   of the Galois field  ,

  ,

such that for any  ,  , the following inequalities hold:

  .

Karatsuba proved that for any fixed  ,  , and arbitrary   satisfying the condition

 

the following estimate holds:

 

where  , and the constant   depends only on   and the basis  .

Estimates of linear sums of characters over shifted prime numbers edit

Karatsuba developed a number of new tools, which, combined with the Vinogradov method of estimating sums with prime numbers, enabled him to obtain in 1970 [38] an estimate of the sum of values of a non-principal character modulo a prime   on a sequence of shifted prime numbers, namely, an estimate of the form

 

where   is an integer satisfying the condition  ,   an arbitrarily small fixed number,  , and the constant   depends on   only.

This claim is considerably stronger than the estimate of Vinogradov, which is non-trivial for  .

In 1971 speaking at the International conference on number theory on the occasion of the 80th birthday of Ivan Matveyevich Vinogradov, Academician Yuri Linnik noted the following:

«Of a great importance are the investigations carried out by Vinogradov in the area of asymptotics of Dirichlet character on shifted primes  , which give a decreased power compared to   compared to  ,  , where   is the modulus of the character. This estimate is of crucial importance, as it is so deep that gives more than the extended Riemann hypothesis, and, it seems, in that directions is a deeper fact than that conjecture (if the conjecture is true). Recently this estimate was improved by A.A.Karatsuba».

This result was extended by Karatsuba to the case when   runs through the primes in an arithmetic progression, the increment of which grows with the modulus  .

Estimates of sums of characters on polynomials with a prime argument edit

Karatsuba found [37][39] a number of estimates of sums of Dirichlet characters in polynomials of degree two for the case when the argument of the polynomial runs through a short sequence of subsequent primes. Let, for instance,   be a sufficiently high prime,  , where   and   are integers, satisfying the condition  , and let

anatoly, karatsuba, anatoly, alexeyevich, karatsuba, first, name, often, spelled, anatolii, russian, Анато, лий, Алексе, евич, Карацу, ба, grozny, soviet, union, january, 1937, moscow, russia, september, 2008, russian, mathematician, working, field, analytic, . Anatoly Alexeyevich Karatsuba his first name often spelled Anatolii Russian Anato lij Alekse evich Karacu ba Grozny Soviet Union 31 January 1937 Moscow Russia 28 September 2008 1 was a Russian mathematician working in the field of analytic number theory p adic numbers and Dirichlet series Anatoly Alexeyevich KaratsubaBorn 1937 01 31 31 January 1937Grozny Soviet UnionDied28 September 2008 2008 09 28 aged 71 Moscow RussiaNationalityRussianAlma materMoscow State UniversityScientific careerFieldsMathematicianDoctoral advisorN M Korobov For most of his student and professional life he was associated with the Faculty of Mechanics and Mathematics of Moscow State University defending a D Sc there entitled The method of trigonometric sums and intermediate value theorems in 1966 2 He later held a position at the Steklov Institute of Mathematics of the Academy of Sciences 2 His textbook Foundations of Analytic Number Theory went to two editions 1975 and 1983 2 The Karatsuba algorithm is the earliest known divide and conquer algorithm for multiplication and lives on as a special case of its direct generalization the Toom Cook algorithm 3 The main research works of Anatoly Karatsuba were published in more than 160 research papers and monographs 4 His daughter Yekaterina Karatsuba also a mathematician constructed the FEE method Contents 1 Work on informatics 1 1 Automata 2 Work on number theory 2 1 The p adic method 2 2 The Hua Luogeng problem on the convergency exponent of the singular integral in the Terry problem 2 3 Multiple trigonometric sums 2 4 The estimate of the Hardy function in the Waring problem 2 5 Multi dimensional analog of the Waring problem 2 6 The Artin problem of local representation of zero by a form 2 7 Estimates of short Kloosterman sums 2 8 The Riemann zeta function 2 8 1 The Selberg zeroes 2 8 2 Distribution of zeros of the Riemann zeta function on the short intervals of the critical line 2 8 3 Zeros of linear combinations of Dirichlet L series 2 8 4 The boundary of zeros of the zeta function and the multi dimensional problem of Dirichlet divisors 2 8 5 Estimates from below of the maximum of the modulus of the zeta function in small regions of the critical domain and on small intervals of the critical line 2 8 6 Behaviour of the argument of the zeta function on the critical line 2 9 The Dirichlet characters 2 9 1 Estimates of short sums of characters in finite fields 2 9 2 Estimates of linear sums of characters over shifted prime numbers 2 9 3 Estimates of sums of characters on polynomials with a prime argument 2 9 4 Lower bounds for sums of characters in polynomials 2 9 5 Sums of characters on additive sequences 2 9 6 Distribution of power congruence classes and primitive roots in sparse sequences 3 Late work 4 Awards and titles 5 See also 6 References 7 External linksWork on informatics editAs a student of Lomonosov Moscow State University Karatsuba attended the seminar of Andrey Kolmogorov and found solutions to two problems set up by Kolmogorov This was essential for the development of automata theory and started a new branch in Mathematics the theory of fast algorithms Automata edit In the paper of Edward F Moore 5 n m p displaystyle n m p nbsp an automaton or a machine S displaystyle S nbsp is defined as a device with n displaystyle n nbsp states m displaystyle m nbsp input symbols and p displaystyle p nbsp output symbols Nine theorems on the structure of S displaystyle S nbsp and experiments with S displaystyle S nbsp are proved Later such S displaystyle S nbsp machines got the name of Moore machines At the end of the paper in the chapter New problems Moore formulates the problem of improving the estimates which he obtained in Theorems 8 and 9 Theorem 8 Moore Given an arbitrary n m p displaystyle n m p nbsp machine S displaystyle S nbsp such that every two states can be distinguished from each other there exists an experiment of length n n 1 2 displaystyle n n 1 2 nbsp that identifies the state of S displaystyle S nbsp at the end of this experiment In 1957 Karatsuba proved two theorems which completely solved the Moore problem on improving the estimate of the length of experiment in his Theorem 8 Theorem A Karatsuba If S displaystyle S nbsp is a n m p displaystyle n m p nbsp machine such that each two its states can be distinguished from each other then there exists a ramified experiment of length at most n 1 n 2 2 1 displaystyle n 1 n 2 2 1 nbsp by means of which one can find the state S displaystyle S nbsp at the end of the experiment Theorem B Karatsuba There exists a n m p displaystyle n m p nbsp machine every states of which can be distinguished from each other such that the length of the shortest experiment finding the state of the machine at the end of the experiment is equal to n 1 n 2 2 1 displaystyle n 1 n 2 2 1 nbsp These two theorems were proved by Karatsuba in his 4th year as a basis of his 4th year project the corresponding paper was submitted to the journal Uspekhi Mat Nauk on December 17 1958 and published in June 1960 6 Up to this day 2011 this result of Karatsuba that later acquired the title the Moore Karatsuba theorem remains the only precise the only precise non linear order of the estimate non linear result both in the automata theory and in the similar problems of the theory of complexity of computations Work on number theory editThe main research works of A A Karatsuba were published in more than 160 research papers and monographs 7 8 9 10 The p adic method edit A A Karatsuba constructed a new p displaystyle p nbsp adic method in the theory of trigonometric sums 11 The estimates of so called L displaystyle L nbsp sums of the form S x 1 P e 2 p i a 1 x p n a n x n p a s p 1 1 s n displaystyle S sum x 1 P e 2 pi i a 1 x p n cdots a n x n p quad a s p 1 quad 1 leq s leq n nbsp led 12 to the new bounds for zeros of the Dirichlet L displaystyle L nbsp series modulo a power of a prime number to the asymptotic formula for the number of Waring congruence of the form x 1 n x t n N mod p k 1 x s P 1 s n P lt p k displaystyle x 1 n dots x t n equiv N pmod p k quad 1 leq x s leq P quad 1 leq s leq n quad P lt p k nbsp to a solution of the problem of distribution of fractional parts of a polynomial with integer coefficients modulo p k displaystyle p k nbsp A A Karatsuba was the first to realize 13 in the p displaystyle p nbsp adic form the embedding principle of Euler Vinogradov and to compute a p displaystyle p nbsp adic analog of Vinogradov u displaystyle u nbsp numbers when estimating the number of solutions of a congruence of the Waring type Assume that x 1 n x t n N mod Q 1 x s P 1 s t 1 displaystyle x 1 n dots x t n equiv N pmod Q quad 1 leq x s leq P quad 1 leq s leq t quad 1 nbsp and moreover P r Q lt P r 1 1 r 1 12 n Q p k k 4 r 1 n displaystyle P r leq Q lt P r 1 quad 1 leq r leq frac 1 12 sqrt n quad Q p k quad k geq 4 r 1 n nbsp where p displaystyle p nbsp is a prime number Karatsuba proved that in that case for any natural number n 144 displaystyle n geq 144 nbsp there exists a p 0 p 0 n displaystyle p 0 p 0 n nbsp such that for any p 0 gt p 0 n displaystyle p 0 gt p 0 n nbsp every natural number N displaystyle N nbsp can be represented in the form 1 for t 20 r 1 displaystyle t geq 20r 1 nbsp and for t lt r displaystyle t lt r nbsp there exist N displaystyle N nbsp such that the congruence 1 has no solutions This new approach found by Karatsuba led to a new p displaystyle p nbsp adic proof of the Vinogradov mean value theorem which plays the central part in the Vinogradov s method of trigonometric sums Another component of the p displaystyle p nbsp adic method of A A Karatsuba is the transition from incomplete systems of equations to complete ones at the expense of the local p displaystyle p nbsp adic change of unknowns 14 Let r displaystyle r nbsp be an arbitrary natural number 1 r n displaystyle 1 leq r leq n nbsp Determine an integer t displaystyle t nbsp by the inequalities m t r m t 1 displaystyle m t leq r leq m t 1 nbsp Consider the system of equations x 1 m 1 x k m 1 y 1 m 1 y k m 1 x 1 m s x k m s y 1 m s y k m s x 1 n x k n y 1 n y k n displaystyle begin cases x 1 m 1 dots x k m 1 y 1 m 1 dots y k m 1 dots dots dots dots dots dots dots dots x 1 m s dots x k m s y 1 m s dots y k m s x 1 n dots x k n y 1 n dots y k n end cases nbsp 1 x 1 x k y 1 y k P 1 m 1 lt m 2 lt lt m s lt m s 1 n displaystyle 1 leq x 1 dots x k y 1 dots y k leq P quad 1 leq m 1 lt m 2 lt dots lt m s lt m s 1 n nbsp Karatsuba proved that the number of solutions I k displaystyle I k nbsp of this system of equations for k 6 r n log n displaystyle k geq 6rn log n nbsp satisfies the estimate I k P 2 k d d m 1 m t s t 1 r displaystyle I k ll P 2k delta quad delta m 1 dots m t s t 1 r nbsp For incomplete systems of equations in which the variables run through numbers with small prime divisors Karatsuba applied multiplicative translation of variables This led to an essentially new estimate of trigonometric sums and a new mean value theorem for such systems of equations The Hua Luogeng problem on the convergency exponent of the singular integral in the Terry problem edit p displaystyle p nbsp adic method of A A Karatsuba includes the techniques of estimating the measure of the set of points with small values of functions in terms of the values of their parameters coefficients etc and conversely the techniques of estimating those parameters in terms of the measure of this set in the real and p displaystyle p nbsp adic metrics This side of Karatsuba s method manifested itself especially clear in estimating trigonometric integrals which led to the solution of the problem of Hua Luogeng In 1979 Karatsuba together with his students G I Arkhipov and V N Chubarikov obtained a complete solution 15 of the Hua Luogeng problem of finding the exponent of convergency of the integral ϑ 0 0 1 e 2 p i a n x n a 1 x d x 2 k d a n d a 1 displaystyle vartheta 0 int limits infty infty cdots int limits infty infty biggl int limits 0 1 e 2 pi i alpha n x n cdots alpha 1 x dx biggr 2k d alpha n ldots d alpha 1 nbsp where n 2 displaystyle n geq 2 nbsp is a fixed number In this case the exponent of convergency means the value g displaystyle gamma nbsp such that ϑ 0 displaystyle vartheta 0 nbsp converges for 2 k gt g e displaystyle 2k gt gamma varepsilon nbsp and diverges for 2 k lt g e displaystyle 2k lt gamma varepsilon nbsp where e gt 0 displaystyle varepsilon gt 0 nbsp is arbitrarily small It was shown that the integral ϑ 0 displaystyle vartheta 0 nbsp converges for 2 k gt 1 2 n 2 n 1 displaystyle 2k gt tfrac 1 2 n 2 n 1 nbsp and diverges for 2 k 1 2 n 2 n 1 displaystyle 2k leq tfrac 1 2 n 2 n 1 nbsp At the same time the similar problem for the integral was solved ϑ 1 0 1 e 2 p i a n x n a m x m a r x r d x 2 k d a n d a m d a r displaystyle vartheta 1 int infty infty cdots int infty infty biggl int 0 1 e 2 pi i alpha n x n alpha m x m cdots alpha r x r dx biggr 2k d alpha n d alpha m ldots d alpha r nbsp where n m r displaystyle n m ldots r nbsp are integers satisfying the conditions 1 r lt lt m lt n r m n lt 1 2 n 2 n displaystyle 1 leq r lt ldots lt m lt n quad r ldots m n lt tfrac 1 2 n 2 n nbsp Karatsuba and his students proved that the integral ϑ 1 displaystyle vartheta 1 nbsp converges if 2 k gt n m r displaystyle 2k gt n m ldots r nbsp and diverges if 2 k n m r displaystyle 2k leq n m ldots r nbsp The integrals ϑ 0 displaystyle vartheta 0 nbsp and ϑ 1 displaystyle vartheta 1 nbsp arise in the studying of the so called Prouhet Tarry Escott problem Karatsuba and his students obtained a series of new results connected with the multi dimensional analog of the Tarry problem In particular they proved that if F displaystyle F nbsp is a polynomial in r displaystyle r nbsp variables r 2 displaystyle r geq 2 nbsp of the form F x 1 x r n 1 0 n 1 n r 0 n r a n 1 n r x 1 n 1 x r n r displaystyle F x 1 ldots x r sum limits nu 1 0 n 1 cdots sum limits nu r 0 n r alpha nu 1 ldots nu r x 1 nu 1 ldots x r nu r nbsp with the zero free term m n 1 1 n r 1 1 displaystyle m n 1 1 ldots n r 1 1 nbsp a displaystyle bar alpha nbsp is the m displaystyle m nbsp dimensional vector consisting of the coefficients of F displaystyle F nbsp then the integral ϑ 2 0 1 0 1 e 2 p i F x 1 x r d x 1 d x r 2 k d a displaystyle vartheta 2 int limits infty infty cdots int limits infty infty biggl int limits 0 1 cdots int limits 0 1 e 2 pi iF x 1 ldots x r dx 1 ldots dx r biggr 2k d bar alpha nbsp converges for 2 k gt m n displaystyle 2k gt mn nbsp where n displaystyle n nbsp is the highest of the numbers n 1 n r displaystyle n 1 ldots n r nbsp This result being not a final one generated a new area in the theory of trigonometric integrals connected with improving the bounds of the exponent of convergency ϑ 2 displaystyle vartheta 2 nbsp I A Ikromov M A Chahkiev and others Multiple trigonometric sums edit In 1966 1980 Karatsuba developed 16 17 with participation of his students G I Arkhipov and V N Chubarikov the theory of multiple Hermann Weyl trigonometric sums that is the sums of the form S S A x 1 1 P 1 x r 1 P r e 2 p i F x 1 x r displaystyle S S A sum x 1 1 P 1 dots sum x r 1 P r e 2 pi iF x 1 dots x r nbsp where F x 1 x r t 1 1 n 1 t r 1 n r a t 1 t r x 1 t 1 x r t r displaystyle F x 1 dots x r sum t 1 1 n 1 dots sum t r 1 n r alpha t 1 dots t r x 1 t 1 dots x r t r nbsp A displaystyle A nbsp is a system of real coefficients a t 1 t r displaystyle alpha t 1 dots t r nbsp The central point of that theory as in the theory of the Vinogradov trigonometric sums is the following mean value theorem Let n 1 n r P 1 P r displaystyle n 1 dots n r P 1 dots P r nbsp be natural numbers P 1 min P 1 P r displaystyle P 1 min P 1 dots P r nbsp m n 1 1 n r 1 displaystyle m n 1 1 dots n r 1 nbsp Furthermore let W displaystyle Omega nbsp be the m displaystyle m nbsp dimensional cube of the form 0 a t 1 t r lt 1 displaystyle 0 leq alpha t 1 dots t r lt 1 nbsp 0 t 1 n 1 0 t r n r displaystyle 0 leq t 1 leq n 1 dots 0 leq t r leq n r nbsp in the euclidean space and J J P 1 P r n 1 n r K r W S A 2 K d A displaystyle J J P 1 dots P r n 1 dots n r K r underset Omega int dots int S A 2K dA nbsp Then for any t 0 displaystyle tau geq 0 nbsp and K K t m t displaystyle K geq K tau m tau nbsp the value J displaystyle J nbsp can be estimated as followsJ K t 2 m t ϰ 4 ϰ 2 D t 2 8 m ϰ t P 1 P r 2 K P ϰ D t displaystyle J leq K tau 2m tau varkappa 4 varkappa 2 Delta tau 2 8m varkappa tau P 1 dots P r 2K P varkappa Delta tau nbsp dd where ϰ n 1 n 1 n r n r displaystyle varkappa n 1 nu 1 dots n r nu r nbsp g ϰ 1 displaystyle gamma varkappa 1 nbsp D t m 2 1 1 g t displaystyle Delta tau frac m 2 1 1 gamma tau nbsp P P 1 n 1 P r n r g displaystyle P P 1 n 1 dots P r n r gamma nbsp and the natural numbers n 1 n r displaystyle nu 1 dots nu r nbsp are such that 1 lt P s P 1 n s 0 displaystyle 1 lt frac P s P 1 nu s leq 0 nbsp s 1 r displaystyle s 1 dots r nbsp The mean value theorem and the lemma on the multiplicity of intersection of multi dimensional parallelepipeds form the basis of the estimate of a multiple trigonometric sum that was obtained by Karatsuba two dimensional case was derived by G I Arkhipov 18 Denoting by Q 0 displaystyle Q 0 nbsp the least common multiple of the numbers q t 1 t r displaystyle q t 1 dots t r nbsp with the condition t 1 t r 1 displaystyle t 1 dots t r geq 1 nbsp for Q 0 P 1 6 displaystyle Q 0 geq P 1 6 nbsp the estimate holds S A 5 n 2 n r n Q 0 t Q 0 r 1 P 1 P r Q 0 1 m 2 8 r r m 1 r 1 P 1 P r P 0 05 m displaystyle S A leq 5n 2n r nu Q 0 tau Q 0 r 1 P 1 dots P r Q 0 1 mu 2 8r r mu 1 r 1 P 1 dots P r P 0 05 mu nbsp where t Q displaystyle tau Q nbsp is the number of divisors of the integer Q displaystyle Q nbsp and n Q displaystyle nu Q nbsp is the number of distinct prime divisors of the number Q displaystyle Q nbsp The estimate of the Hardy function in the Waring problem edit Applying his p displaystyle p nbsp adic form of the Hardy Littlewood Ramanujan Vinogradov method to estimating trigonometric sums in which the summation is taken over numbers with small prime divisors Karatsuba obtained 19 a new estimate of the well known Hardy function G n displaystyle G n nbsp in the Waring s problem for n 400 displaystyle n geq 400 nbsp G n lt 2 n log n 2 n log log n 12 n displaystyle G n lt 2n log n 2n log log n 12n nbsp Multi dimensional analog of the Waring problem edit In his subsequent investigation of the Waring problem Karatsuba obtained 20 the following two dimensional generalization of that problem Consider the system of equations x 1 n i y 1 i x k n i y k i N i displaystyle x 1 n i y 1 i dots x k n i y k i N i nbsp i 0 1 n displaystyle i 0 1 dots n nbsp where N i displaystyle N i nbsp are given positive integers with the same order or growth N 0 displaystyle N 0 to infty nbsp and x ϰ y ϰ displaystyle x varkappa y varkappa nbsp are unknowns which are also positive integers This system has solutions if k gt c n 2 log n displaystyle k gt cn 2 log n nbsp and if k lt c 1 n 2 displaystyle k lt c 1 n 2 nbsp then there exist such N i displaystyle N i nbsp that the system has no solutions The Artin problem of local representation of zero by a form edit Emil Artin had posed the problem on the p displaystyle p nbsp adic representation of zero by a form of arbitrary degree d Artin initially conjectured a result which would now be described as the p adic field being a C2 field in other words non trivial representation of zero would occur if the number of variables was at least d2 This was shown not to be the case by an example of Guy Terjanian Karatsuba showed that in order to have a non trivial representation of zero by a form the number of variables should grow faster than polynomially in the degree d this number in fact should have an almost exponential growth depending on the degree Karatsuba and his student Arkhipov proved 21 that for any natural number r displaystyle r nbsp there exists n 0 n 0 r displaystyle n 0 n 0 r nbsp such that for any n n 0 displaystyle n geq n 0 nbsp there is a form with integral coefficients F x 1 x k displaystyle F x 1 dots x k nbsp of degree smaller than n displaystyle n nbsp the number of variables of which is k displaystyle k nbsp k 2 u displaystyle k geq 2 u nbsp u n log 2 n log 2 log 2 n log 2 log 2 n r log 2 log 2 n 3 r 1 displaystyle u frac n log 2 n log 2 log 2 n dots underbrace log 2 dots log 2 n r underbrace log 2 dots log 2 n 3 r 1 nbsp which has only trivial representation of zero in the 2 adic numbers They also obtained a similar result for any odd prime modulus p displaystyle p nbsp Estimates of short Kloosterman sums edit Karatsuba developed 22 23 24 1993 1999 a new method of estimating short Kloosterman sums that is trigonometric sums of the form n A exp 2 p i a n b n m displaystyle sum limits n in A exp biggl 2 pi i frac an bn m biggr nbsp where n displaystyle n nbsp runs through a set A displaystyle A nbsp of numbers coprime to m displaystyle m nbsp the number of elements A displaystyle A nbsp in which is essentially smaller than m displaystyle m nbsp and the symbol n displaystyle n nbsp denotes the congruence class inverse to n displaystyle n nbsp modulo m displaystyle m nbsp n n 1 mod m displaystyle nn equiv 1 mod m nbsp Up to the early 1990s the estimates of this type were known mainly for sums in which the number of summands was higher than m displaystyle sqrt m nbsp H D Kloosterman I M Vinogradov H Salie L Carlitz S Uchiyama A Weil The only exception was the special moduli of the form m p a displaystyle m p alpha nbsp where p displaystyle p nbsp is a fixed prime and the exponent a displaystyle alpha nbsp increases to infinity this case was studied by A G Postnikov by means of the method of Vinogradov Karatsuba s method makes it possible to estimate Kloosterman sums where the number of summands does not exceed m e displaystyle m varepsilon nbsp and in some cases even exp ln m 2 3 e displaystyle exp ln m 2 3 varepsilon nbsp where e gt 0 displaystyle varepsilon gt 0 nbsp is an arbitrarily small fixed number The final paper of Karatsuba on this subject 25 was published posthumously Various aspects of the method of Karatsuba have found applications in the following problems of analytic number theory finding asymptotics of the sums of fractional parts of the form n x a n b n m p x a p b p m displaystyle sum n leq x biggl frac an bn m biggr sum p leq x biggl frac ap bp m biggr nbsp where n displaystyle n nbsp runs one after another through the integers satisfying the condition n m 1 displaystyle n m 1 nbsp and p displaystyle p nbsp runs through the primes that do not divide the module m displaystyle m nbsp Karatsuba finding a lower bound for the number of solutions of inequalities of the form a lt a n b n m b displaystyle alpha lt biggl frac an bn m biggr leq beta nbsp in the integers n displaystyle n nbsp 1 n x displaystyle 1 leq n leq x nbsp coprime to m displaystyle m nbsp x lt m displaystyle x lt sqrt m nbsp Karatsuba the precision of approximation of an arbitrary real number in the segment 0 1 displaystyle 0 1 nbsp by fractional parts of the form a n b n m displaystyle biggl frac an bn m biggr nbsp where 1 n x displaystyle 1 leq n leq x nbsp n m 1 displaystyle n m 1 nbsp x lt m displaystyle x lt sqrt m nbsp Karatsuba a more precise constant c displaystyle c nbsp in the Brun Titchmarsh theorem p x q l lt c x f q ln 2 x q displaystyle pi x q l lt frac cx varphi q ln frac 2x q nbsp where p x q l displaystyle pi x q l nbsp is the number of primes p displaystyle p nbsp not exceeding x displaystyle x nbsp and belonging to the arithmetic progression p l mod q displaystyle p equiv l pmod q nbsp J Friedlander H Iwaniec a lower bound for the greatest prime divisor of the product of numbers of the form n 3 2 displaystyle n 3 2 nbsp N lt n 2 N displaystyle N lt n leq 2N nbsp D R Heath Brown proving that there are infinitely many primes of the form a 2 b 4 displaystyle a 2 b 4 nbsp J Friedlander H Iwaniec combinatorial properties of the set of numbers n mod m displaystyle n pmod m nbsp 1 n m e displaystyle 1 leq n leq m varepsilon nbsp A A Glibichuk The Riemann zeta function edit The Selberg zeroes edit In 1984 Karatsuba proved 26 27 that for a fixed e displaystyle varepsilon nbsp satisfying the condition 0 lt e lt 0 001 displaystyle 0 lt varepsilon lt 0 001 nbsp a sufficiently large T displaystyle T nbsp and H T a e displaystyle H T a varepsilon nbsp a 27 82 1 3 1 246 displaystyle a tfrac 27 82 tfrac 1 3 tfrac 1 246 nbsp the interval T T H displaystyle T T H nbsp contains at least c H ln T displaystyle cH ln T nbsp real zeros of the Riemann zeta function z 1 2 i t displaystyle zeta Bigl tfrac 1 2 it Bigr nbsp The special case H T 1 2 e displaystyle H geq T 1 2 varepsilon nbsp was proven by Atle Selberg earlier in 1942 28 The estimates of Atle Selberg and Karatsuba can not be improved in respect of the order of growth as T displaystyle T to infty nbsp Distribution of zeros of the Riemann zeta function on the short intervals of the critical line edit Karatsuba also obtained 29 a number of results about the distribution of zeros of z s displaystyle zeta s nbsp on short intervals of the critical line He proved that an analog of the Selberg conjecture holds for almost all intervals T T H displaystyle T T H nbsp H T e displaystyle H T varepsilon nbsp where e displaystyle varepsilon nbsp is an arbitrarily small fixed positive number Karatsuba developed 1992 a new approach to investigating zeros of the Riemann zeta function on supershort intervals of the critical line that is on the intervals T T H displaystyle T T H nbsp the length H displaystyle H nbsp of which grows slower than any even arbitrarily small degree T displaystyle T nbsp In particular he proved that for any given numbers e displaystyle varepsilon nbsp e 1 displaystyle varepsilon 1 nbsp satisfying the conditions 0 lt e e 1 lt 1 displaystyle 0 lt varepsilon varepsilon 1 lt 1 nbsp almost all intervals T T H displaystyle T T H nbsp for H exp ln T e displaystyle H geq exp ln T varepsilon nbsp contain at least H ln T 1 e 1 displaystyle H ln T 1 varepsilon 1 nbsp zeros of the function z 1 2 i t displaystyle zeta bigl tfrac 1 2 it bigr nbsp This estimate is quite close to the one that follows from the Riemann hypothesis Zeros of linear combinations of Dirichlet L series edit Karatsuba developed a new method 30 31 of investigating zeros of functions which can be represented as linear combinations of Dirichlet L displaystyle L nbsp series The simplest example of a function of that type is the Davenport Heilbronn function defined by the equality f s 1 2 1 i k L s x 1 2 1 i k L s x displaystyle f s tfrac 1 2 1 i kappa L s chi tfrac 1 2 1 i kappa L s bar chi nbsp where x displaystyle chi nbsp is a non principal character modulo 5 displaystyle 5 nbsp x 1 1 displaystyle chi 1 1 nbsp x 2 i displaystyle chi 2 i nbsp x 3 i displaystyle chi 3 i nbsp x 4 1 displaystyle chi 4 1 nbsp x 5 0 displaystyle chi 5 0 nbsp x n 5 x n displaystyle chi n 5 chi n nbsp for any n displaystyle n nbsp k 10 2 5 2 5 1 displaystyle kappa frac sqrt 10 2 sqrt 5 2 sqrt 5 1 nbsp For f s displaystyle f s nbsp Riemann hypothesis is not true however the critical line R e s 1 2 displaystyle Re s tfrac 1 2 nbsp contains nevertheless abnormally many zeros Karatsuba proved 1989 that the interval T T H displaystyle T T H nbsp H T 27 82 e displaystyle H T 27 82 varepsilon nbsp contains at least H ln T 1 2 e c ln ln T displaystyle H ln T 1 2 e c sqrt ln ln T nbsp zeros of the function f 1 2 i t displaystyle f bigl tfrac 1 2 it bigr nbsp Similar results were obtained by Karatsuba also for linear combinations containing arbitrary finite number of summands the degree exponent 1 2 displaystyle tfrac 1 2 nbsp is here replaced by a smaller number b displaystyle beta nbsp that depends only on the form of the linear combination The boundary of zeros of the zeta function and the multi dimensional problem of Dirichlet divisors edit nbsp To Karatsuba belongs a new breakthrough result 32 in the multi dimensional problem of Dirichlet divisors which is connected with finding the number D k x displaystyle D k x nbsp of solutions of the inequality x 1 x k x displaystyle x 1 ldots x k leq x nbsp in the natural numbers x 1 x k displaystyle x 1 ldots x k nbsp as x displaystyle x to infty nbsp For D k x displaystyle D k x nbsp there is an asymptotic formula of the form D k x x P k 1 ln x R k x displaystyle D k x xP k 1 ln x R k x nbsp where P k 1 u displaystyle P k 1 u nbsp is a polynomial of degree k 1 displaystyle k 1 nbsp the coefficients of which depend on k displaystyle k nbsp and can be found explicitly and R k x displaystyle R k x nbsp is the remainder term all known estimates of which up to 1960 were of the form R k x x 1 a k c ln x k displaystyle R k x leq x 1 alpha k c ln x k nbsp where a 1 a k b displaystyle alpha frac 1 ak b nbsp a b c displaystyle a b c nbsp are some absolute positive constants Karatsuba obtained a more precise estimate of R k x displaystyle R k x nbsp in which the value a k displaystyle alpha k nbsp was of order k 2 3 displaystyle k 2 3 nbsp and was decreasing much slower than a k displaystyle alpha k nbsp in the previous estimates Karatsuba s estimate is uniform in x displaystyle x nbsp and k displaystyle k nbsp in particular the value k displaystyle k nbsp may grow as x displaystyle x nbsp grows as some power of the logarithm of x displaystyle x nbsp A similar looking but weaker result was obtained in 1960 by a German mathematician Richert whose paper remained unknown to Soviet mathematicians at least until the mid seventies Proof of the estimate of R k x displaystyle R k x nbsp is based on a series of claims essentially equivalent to the theorem on the boundary of zeros of the Riemann zeta function obtained by the method of Vinogradov that is the theorem claiming that z s displaystyle zeta s nbsp has no zeros in the region R e s 1 c ln t 2 3 ln ln t 1 3 t gt 10 displaystyle Re s geq 1 frac c ln t 2 3 ln ln t 1 3 quad t gt 10 nbsp Karatsuba found 33 2000 the backward relation of estimates of the values R k x displaystyle R k x nbsp with the behaviour of z s displaystyle zeta s nbsp near the line R e s 1 displaystyle Re s 1 nbsp In particular he proved that if a y displaystyle alpha y nbsp is an arbitrary non increasing function satisfying the condition 1 y a y 1 2 displaystyle 1 y leq alpha y leq 1 2 nbsp such that for all k 2 displaystyle k geq 2 nbsp the estimate R k x x 1 a k c ln x k displaystyle R k x leq x 1 alpha k c ln x k nbsp holds then z s displaystyle zeta s nbsp has no zeros in the region R e s 1 c 1 a ln t ln ln t t e 2 displaystyle Re s geq 1 c 1 frac alpha ln t ln ln t quad t geq e 2 nbsp c c 1 displaystyle c c 1 nbsp are some absolute constants Estimates from below of the maximum of the modulus of the zeta function in small regions of the critical domain and on small intervals of the critical line edit Karatsuba introduced and studied 34 the functions F T H displaystyle F T H nbsp and G s 0 D displaystyle G s 0 Delta nbsp defined by the equalities F T H max t T H z 1 2 i t G s 0 D max s s 0 D z s displaystyle F T H max t T leq H bigl zeta bigl tfrac 1 2 it bigr bigr quad G s 0 Delta max s s 0 leq Delta zeta s nbsp Here T displaystyle T nbsp is a sufficiently large positive number 0 lt H ln ln T displaystyle 0 lt H ll ln ln T nbsp s 0 s 0 i T displaystyle s 0 sigma 0 iT nbsp 1 2 s 0 1 displaystyle tfrac 1 2 leq sigma 0 leq 1 nbsp 0 lt D lt 1 3 displaystyle 0 lt Delta lt tfrac 1 3 nbsp Estimating the values F displaystyle F nbsp and G displaystyle G nbsp from below shows how large in modulus values z s displaystyle zeta s nbsp can take on short intervals of the critical line or in small neighborhoods of points lying in the critical strip 0 R e s 1 displaystyle 0 leq Re s leq 1 nbsp The case H ln ln T displaystyle H gg ln ln T nbsp was studied earlier by Ramachandra the case D gt c displaystyle Delta gt c nbsp where c displaystyle c nbsp is a sufficiently large constant is trivial Karatsuba proved in particular that if the values H displaystyle H nbsp and D displaystyle Delta nbsp exceed certain sufficiently small constants then the estimatesF T H T c 1 G s 0 D T c 2 displaystyle F T H geq T c 1 quad G s 0 Delta geq T c 2 nbsp hold where c 1 c 2 displaystyle c 1 c 2 nbsp are certain absolute constants Behaviour of the argument of the zeta function on the critical line edit Karatsuba obtained a number of new results 35 36 related to the behaviour of the function S t 1 p arg z 1 2 i t displaystyle S t frac 1 pi arg zeta bigl tfrac 1 2 it bigr nbsp which is called the argument of Riemann zeta function on the critical line here arg z 1 2 i t displaystyle arg zeta bigl tfrac 1 2 it bigr nbsp is the increment of an arbitrary continuous branch of arg z s displaystyle arg zeta s nbsp along the broken line joining the points 2 2 i t displaystyle 2 2 it nbsp and 1 2 i t displaystyle tfrac 1 2 it nbsp Among those results are the mean value theorems for the function S t displaystyle S t nbsp and its first integral S 1 t 0 t S u d u displaystyle S 1 t int 0 t S u du nbsp on intervals of the real line and also the theorem claiming that every interval T T H displaystyle T T H nbsp for H T 27 82 e displaystyle H geq T 27 82 varepsilon nbsp contains at least H ln T 1 3 e c ln ln T displaystyle H ln T 1 3 e c sqrt ln ln T nbsp points where the function S t displaystyle S t nbsp changes sign Earlier similar results were obtained by Atle Selberg for the case H T 1 2 e displaystyle H geq T 1 2 varepsilon nbsp The Dirichlet characters edit Estimates of short sums of characters in finite fields edit In the end of the sixties Karatsuba estimating short sums of Dirichlet characters developed 37 a new method making it possible to obtain non trivial estimates of short sums of characters in finite fields Let n 2 displaystyle n geq 2 nbsp be a fixed integer F x x n a n 1 x n 1 a 1 x a 0 displaystyle F x x n a n 1 x n 1 ldots a 1 x a 0 nbsp a polynomial irreducible over the field Q displaystyle mathbb Q nbsp of rational numbers 8 displaystyle theta nbsp a root of the equation F 8 0 displaystyle F theta 0 nbsp Q 8 displaystyle mathbb Q theta nbsp the corresponding extension of the field Q displaystyle mathbb Q nbsp w 1 w n displaystyle omega 1 ldots omega n nbsp a basis of Q 8 displaystyle mathbb Q theta nbsp w 1 1 displaystyle omega 1 1 nbsp w 2 8 displaystyle omega 2 theta nbsp w 3 8 2 w n 8 n 1 displaystyle omega 3 theta 2 ldots omega n theta n 1 nbsp Furthermore let p displaystyle p nbsp be a sufficiently large prime such that F x displaystyle F x nbsp is irreducible modulo p displaystyle p nbsp G F p n displaystyle mathrm GF p n nbsp the Galois field with a basis w 1 w 2 w n displaystyle omega 1 omega 2 ldots omega n nbsp x displaystyle chi nbsp a non principal Dirichlet character of the field G F p n displaystyle mathrm GF p n nbsp Finally let n 1 n n displaystyle nu 1 ldots nu n nbsp be some nonnegative integers D X displaystyle D X nbsp the set of elements x displaystyle bar x nbsp of the Galois field G F p n displaystyle mathrm GF p n nbsp x x 1 w 1 x n w n displaystyle bar x x 1 omega 1 ldots x n omega n nbsp such that for any i displaystyle i nbsp 1 i n displaystyle 1 leq i leq n nbsp the following inequalities hold n i lt x i lt n i X displaystyle nu i lt x i lt nu i X nbsp Karatsuba proved that for any fixed k displaystyle k nbsp k n 1 displaystyle k geq n 1 nbsp and arbitrary X displaystyle X nbsp satisfying the condition p 1 4 1 4 k X p 1 2 1 4 k displaystyle p frac 1 4 frac 1 4k leq X leq p frac 1 2 frac 1 4k nbsp the following estimate holds x D X x x c X 1 1 k p 1 4 k 1 4 k 2 n ln p g displaystyle biggl sum limits bar x in D X chi bar x biggr leq c Bigl X 1 frac 1 k p frac 1 4k frac 1 4k 2 Bigr n ln p gamma nbsp where g 1 k 2 n 1 1 displaystyle gamma frac 1 k 2 n 1 1 nbsp and the constant c displaystyle c nbsp depends only on n displaystyle n nbsp and the basis w 1 w n displaystyle omega 1 ldots omega n nbsp Estimates of linear sums of characters over shifted prime numbers edit Karatsuba developed a number of new tools which combined with the Vinogradov method of estimating sums with prime numbers enabled him to obtain in 1970 38 an estimate of the sum of values of a non principal character modulo a prime q displaystyle q nbsp on a sequence of shifted prime numbers namely an estimate of the form p N x p k c N q e 2 1024 displaystyle biggl sum limits p leq N chi p k biggr leq cNq frac varepsilon 2 1024 nbsp where k displaystyle k nbsp is an integer satisfying the condition k 0 mod q displaystyle k not equiv 0 mod q nbsp e displaystyle varepsilon nbsp an arbitrarily small fixed number N q 1 2 e displaystyle N geq q 1 2 varepsilon nbsp and the constant c displaystyle c nbsp depends on e displaystyle varepsilon nbsp only This claim is considerably stronger than the estimate of Vinogradov which is non trivial for N q 3 4 e displaystyle N geq q 3 4 varepsilon nbsp In 1971 speaking at the International conference on number theory on the occasion of the 80th birthday of Ivan Matveyevich Vinogradov Academician Yuri Linnik noted the following Of a great importance are the investigations carried out by Vinogradov in the area of asymptotics of Dirichlet character on shifted primes p N x p k displaystyle sum limits p leq N chi p k nbsp which give a decreased power compared to N displaystyle N nbsp compared to N q 3 4 e displaystyle N geq q 3 4 varepsilon nbsp e gt 0 displaystyle varepsilon gt 0 nbsp where q displaystyle q nbsp is the modulus of the character This estimate is of crucial importance as it is so deep that gives more than the extended Riemann hypothesis and it seems in that directions is a deeper fact than that conjecture if the conjecture is true Recently this estimate was improved by A A Karatsuba This result was extended by Karatsuba to the case when p displaystyle p nbsp runs through the primes in an arithmetic progression the increment of which grows with the modulus q displaystyle q nbsp Estimates of sums of characters on polynomials with a prime argument edit Karatsuba found 37 39 a number of estimates of sums of Dirichlet characters in polynomials of degree two for the case when the argument of the polynomial runs through a short sequence of subsequent primes Let for instance q displaystyle q nbsp be a sufficiently high prime f x x a x b displaystyle f x x a x b nbsp where a displaystyle a nbsp and b displaystyle b nbsp are integers satisfying the condition a b a b 0 mod q displaystyle ab a b not equiv 0 mod q nbsp and let n q displaystyle left frac n q right span, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.