Arithmetic functions and integer products
This is a once usual, but now an all but extinct sort of publication: a research book. In 1946, Erdős proved that an additive arithmetical function f must be a multiple of the logarithm if it is monotonic, or if \(f(n+1)-f(n)\to 0\). Since then, lots of results appeared that asserted that a regular additive function (in various senses) must be equal or near to a multiple of the logarithm. E.g. Wirsing showed that if f is completely additive and \(f(n+1)-f(n)=o(\log n),\) then \(f(n)=c \log n;\) if \(f(n+1)- f(n)=O((\log n)^ c),\) where either \(1\leq c\leq 6/5\) or \(c\geq 3\), then \(f(n)=O((\log n)^ c).\) These results suggested that the proper approach would be to find a finite, effective result. The reviewer conjectured that with \(\max_{n\leq x}| f(n+1)-f(n)| =K\) always there is an L such that \(| f(n)-L \log n| \leq c_ 1K\) for \(n\leq x^ c\), with positive absolute constants \(c,c_ 1\). This would easily yield the above results, without the restriction on the exponent. Shortly after that, the author announced a result that was even stronger than that conjecture, in two directions: he used quadratic mean rather than the maximum, and considered more general differences of the form \(f(an+b)-f(An+B).\) This is the main result of the book (Theorem 10.1). Let f be an additive function, a,b,A,B positive integers, \(\Delta =aB+Ab\neq 0.\) Write \[ K=\max_{x\leq y\leq x^ c}y^{-1}\sum_{x\leq n\leq y}| f(an+b)-f(An+B)|^ 2. \] With a suitable L we have \[ \sum_{p^ k\leq x, p \nmid aA}| f(p^ k)-L \log p^ k|^ 2 p^{-k}\leq CK, \] where c,C depend on a,b,A,B, and L depends on f and x (which is specified in the book). This is an extremely general result: it easily implies practically everything that has so far been said on the diference of additive functions, and a lot more. The proof is very complicated (it occupies about the first 240 pages of the book), and I do not claim to have understood it completely. The main role seems to be played by the author's version of Bombieri's large sieve method. Now to the second part of the book, Integer products. A seemingly natural way to attack the above problem would be the following. If \(f(an+b)-f(An+B)\) is small on all or most numbers \(n\leq x\), then, by additivity, it is also small on numbers m representable in the form \(m=((An_ 1+B)/(an_ 1+b))^{r_ 1}...((An_ k+B)/(an_ k+b))^{r_ k},\) with rational \(r_ j\). Now one could try to show that every integer (say up to \(x^ c)\) can be written in this form, with preferably small k and \(r_ j\). This does not work; but the author makes it work the other way, namely he is able to apply his result on additive functions to deduce the existence of such representations. E.g. (Theorem 17.1) let \(R(x)=\prod^{h}_{i=1}(x+a_ i)^{b_ i}\) be a rational function with integers \(a_ i\) and \(b_ i\), and assume that the exponents \(b_ i\) are coprime. Then every positive integer n has a representation \(n=\prod R(n_ j)^{\epsilon_ j}\), with \(\epsilon_ j=\pm 1\) and \(n_ j\leq cn.\) An application to information theory is given in Chapter 20, and a central limit theorem for \(f(n+1)-f(n)\) is deduced in Chapter 21. Chapter 23 supplies a collection of 108 exercises and 18 unsolved problems. Finally there is a supplement that is a sort of appendix to the author's previous monograph [Probabilistic number theory. I,II (1979; Zbl 0431.10029), (1980; Zbl 0431.10030)] briefly describing recent progress in this field. The book can be highly recommended to number theorists.
- On the multiplicative group generated by a dense sequence of integers
- The distribution of the number of prime divisors of sums a+b
- Multiplicative functions satisfying a congruence property. V
- Distribution of the values of a sum of additive functions with shifted arguments
- The concentration function of additive functions on shifted primes
- Paul Erdős on functional equations: Contributions and impact
- Set of uniqueness of shifted Gaussian primes
- Discrete uniform limit law for a sum of additive functions on shifted primes
- Erdős and the integers
- Additive functions in short intervals, gaps and a conjecture of Erdős
- Jonas Kubilius and probabilistic number theory some personal reflections
- Jonas Kubilius and genesis of probabilistic number theory
- Primes in progressions to moduli with a large power factor
- Discrete uniform distribution for a sum of additive functions
- Some relations among multiplicative and q-additive functions
- Multiplicative Functions on Arithmetic Progressions
- Additive Functions at Consecutive Integers
- Persistence of Form and the Value Group of Reducible Cubics
- Functional analysis and additive arithmetic functions
- Additive arithmetic functions on intervals
- Multiplicative functions on arithmetic progressions, II.
- scientific article; zbMATH DE number 1059853 (Why is no real title available?)
- scientific article; zbMATH DE number 1985598 (Why is no real title available?)
- HARMONIC ANALYSIS ON THE POSITIVE RATIONALS. DETERMINATION OF THE GROUP GENERATED BY THE RATIOS
- Multiplicative functions at consecutive integers
- A characterization of the identity with functional equations. II
- Average order in cyclic groups
- On additive functions
- Harmonic analysis on the positive rationals: computation of character sums
- On the geometric mean of the values of positive multiplicative arithmetical functions
- An Euler product transform applied to q-series
- Weighted power mean discrete dynamical systems: fast convergence properties
- The value distribution of differences of additive arithmetic functions
- Poisson distribution for a sum of additive functions
- Additive functions on arithmetic progressions with large moduli
This page was built for publication: Arithmetic functions and integer products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347966)