On the values of multiplicative functions in short intervals

1969 ◽  
Vol 183 (3) ◽  
pp. 181-184
Author(s):  
I. K�tai
2016 ◽  
Vol 4 ◽  
Author(s):  
TERENCE TAO

Let $\unicode[STIX]{x1D706}$ denote the Liouville function. The Chowla conjecture, in the two-point correlation case, asserts that $$\begin{eqnarray}\mathop{\sum }_{n\leqslant x}\unicode[STIX]{x1D706}(a_{1}n+b_{1})\unicode[STIX]{x1D706}(a_{2}n+b_{2})=o(x)\end{eqnarray}$$ as $x\rightarrow \infty$, for any fixed natural numbers $a_{1},a_{2}$ and nonnegative integer $b_{1},b_{2}$ with $a_{1}b_{2}-a_{2}b_{1}\neq 0$. In this paper we establish the logarithmically averaged version $$\begin{eqnarray}\mathop{\sum }_{x/\unicode[STIX]{x1D714}(x)<n\leqslant x}\frac{\unicode[STIX]{x1D706}(a_{1}n+b_{1})\unicode[STIX]{x1D706}(a_{2}n+b_{2})}{n}=o(\log \unicode[STIX]{x1D714}(x))\end{eqnarray}$$ of the Chowla conjecture as $x\rightarrow \infty$, where $1\leqslant \unicode[STIX]{x1D714}(x)\leqslant x$ is an arbitrary function of $x$ that goes to infinity as $x\rightarrow \infty$, thus breaking the ‘parity barrier’ for this problem. Our main tools are the multiplicativity of the Liouville function at small primes, a recent result of Matomäki, Radziwiłł, and the author on the averages of modulated multiplicative functions in short intervals, concentration of measure inequalities, the Hardy–Littlewood circle method combined with a restriction theorem for the primes, and a novel ‘entropy decrement argument’. Most of these ingredients are also available (in principle, at least) for the higher order correlations, with the main missing ingredient being the need to control short sums of multiplicative functions modulated by local nilsequences. Our arguments also extend to more general bounded multiplicative functions than the Liouville function $\unicode[STIX]{x1D706}$, leading to a logarithmically averaged version of the Elliott conjecture in the two-point case. In a subsequent paper we will use this version of the Elliott conjecture to affirmatively settle the Erdős discrepancy problem.


2019 ◽  
Vol 7 ◽  
Author(s):  
TERENCE TAO ◽  
JONI TERÄVÄINEN

We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set $A$ whose indicator function is ‘approximately multiplicative’ and uniformly distributed on short intervals in a suitable sense, we show that the density of the pattern $n+1\in A$ , $n+2\in A$ , $n+3\in A$ is positive as long as $A$ has density greater than $\frac{1}{3}$ . Using an inverse theorem for sumsets and some tools from ergodic theory, we also provide a theorem that deals with the critical case of $A$ having density exactly $\frac{1}{3}$ , below which one would need nontrivial information on the local distribution of $A$ in Bohr sets to proceed. We apply our results first to answer in a stronger form a question of Erdős and Pomerance on the relative orderings of the largest prime factors $P^{+}(n)$ , $P^{+}(n+1),P^{+}(n+2)$ of three consecutive integers. Second, we show that the tuple $(\unicode[STIX]{x1D714}(n+1),\unicode[STIX]{x1D714}(n+2),\unicode[STIX]{x1D714}(n+3))~(\text{mod}~3)$ takes all the $27$ possible patterns in $(\mathbb{Z}/3\mathbb{Z})^{3}$ with positive lower density, with $\unicode[STIX]{x1D714}(n)$ being the number of distinct prime divisors. We also prove a theorem concerning longer patterns $n+i\in A_{i}$ , $i=1,\ldots ,k$ in approximately multiplicative sets $A_{i}$ having large enough densities, generalizing some results of Hildebrand on his ‘stable sets conjecture’. Finally, we consider the sign patterns of the Liouville function $\unicode[STIX]{x1D706}$ and show that there are at least $24$ patterns of length $5$ that occur with positive upper density. In all the proofs, we make extensive use of recent ideas concerning correlations of multiplicative functions.


2015 ◽  
Vol 11 (05) ◽  
pp. 1571-1587 ◽  
Author(s):  
Alisa Sedunova

We are going to study the mean values of some multiplicative functions connected with the divisor function in short interval of summation. The asymptotics for such mean values will be proved. Considering instead of well-known multiplicative functions, their inverses lead to very weak results of application of standard methods of complex integration. In order to get better estimations, we propose another method which uses as its main tools the density estimates and zero-free region for Riemann ζ-function and Dirichlet L-functions.


2016 ◽  
Vol 183 (3) ◽  
pp. 1015-1056 ◽  
Author(s):  
Kaisa Matomäki ◽  
Maksym Radziwiłł

2012 ◽  
Vol 2012 (3) ◽  
pp. 479-492 ◽  
Author(s):  
Sourav Chatterjee ◽  
Kannan Soundararajan

2019 ◽  
Vol 220 (1) ◽  
pp. 1-58
Author(s):  
Kaisa Matomäki ◽  
Maksym Radziwiłł ◽  
Terence Tao

1987 ◽  
Vol 39 (3) ◽  
pp. 646-672 ◽  
Author(s):  
Adolf Hildebrand

A central problem in probabilistic number theory is to evaluate asymptotically the partial sumsof multiplicative functions f and, in particular, to find conditions for the existence of the “mean value”1.1In the last two decades considerable progress has been made on this problem, and the results obtained are very satisfactory.


Sign in / Sign up

Export Citation Format

Share Document