https://arxiv.org/api/HemhVkAWq76lidmJjnhW6JnBSyoarXiv Query: search_query=&id_list=2005.03811,2009.08969,1509.05422,2107.02158,1405.0682,1808.04001&start=0&max_results=202026-09-17T05:49:48Z2060http://arxiv.org/abs/2009.08969v2Averages of the Möbius function on shifted primes2021-10-20T18:19:40ZIt is a folklore conjecture that the Möbius function exhibits cancellation on shifted primes; that is, $\sum_{p\le X}μ(p+h) \ = \ o(π(X))$ as $X\to\infty$ for any fixed shift $h>0$. This appears in print at least since Hildebrand in 1989. We prove the conjecture on average for shifts $h\le H$, provided $\log H/\log\log X\to\infty$. We also obtain results for shifts of prime $k$-tuples, and for higher correlations of Möbius with von Mangoldt and divisor functions. Our argument combines sieve methods with a refinement of Matomäki, Radziwiłł, and Tao's work on an averaged form of Chowla's conjecture.2020-09-18T17:54:09Z25 pagesQuarterly Journal of Mathematics (2021), 1-29Jared Duker Lichtman10.1093/qmath/haab054http://arxiv.org/abs/1808.04001v2On the Chowla and twin primes conjectures over $\mathbb F_q[T]$2019-09-07T13:22:55ZUsing geometric methods, we improve on the function field version of the Burgess bound, and show that, when restricted to certain special subspaces, the Möbius function over $\mathbb F_q[T]$ can be mimicked by Dirichlet characters. Combining these, we obtain a level of distribution close to $1$ for the Möbius function in arithmetic progressions, and resolve Chowla's $k$-point correlation conjecture with large uniformity in the shifts. Using a function field variant of a result by Fouvry-Michel on exponential sums involving the Möbius function, we obtain a level of distribution beyond $1/2$ for irreducible polynomials, and establish the twin prime conjecture in a quantitative form. All these results hold for finite fields satisfying a simple condition.2018-08-12T20:25:03ZWill SawinMark Shustermanhttp://arxiv.org/abs/1405.0682v7A note on correlations of arithmetic functions2022-05-04T07:26:18ZIn this note we describe weight functions that exhibit a transitional behavior between weak and strong correlation with the Liouville function. We also describe a binary problem which may be considered as an interpolation between Chowla's conjecture for two-point correlations of the Möbius function and the twin prime conjecture, in view of recent parity breaking results of K. Matomäki, M. Radziwiłł and T. Tao.2014-05-04T11:13:37ZSergei PreobrazhenskiiTatyana Preobrazhenskayahttp://arxiv.org/abs/1509.05422v4The logarithmically averaged Chowla and Elliott conjectures for two-point correlations2016-07-29T18:59:13ZLet $λ$ denote the Liouville function. The Chowla conjecture, in the two-point correlation case, asserts that $$ \sum_{n \leq x} λ(a_1 n + b_1) λ(a_2 n+b_2) = o(x) $$ as $x \to \infty$, for any fixed natural numbers $a_1,a_2,b_1,b_2$ with $a_1b_2-a_2b_1 \neq 0$. In this paper we establish the logarithmically averaged version $$ \sum_{x/ω(x) < n \leq x} \frac{λ(a_1 n + b_1) λ(a_2 n+b_2)}{n} = o(\log ω(x)) $$ of the Chowla conjecture as $x \to \infty$, where $1 \leq ω(x) \leq x$ is an arbitrary function of $x$ that goes to infinity as $x \to \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 $λ$, 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.2015-09-17T20:17:58Z32 pages, no figures, submitted, Forum of Mathematics, Pi. This is the final version, incorporating the second round of referee comments and also with updated referencesTerence Taohttp://arxiv.org/abs/2107.02158v4Quantitative bounds for Gowers uniformity of the Möbius and von Mangoldt functions2023-11-09T12:29:05ZWe establish quantitative bounds on the $U^k[N]$ Gowers norms of the Möbius function $μ$ and the von Mangoldt function $Λ$ for all $k$, with error terms of shape $O((\log\log N)^{-c})$. As a consequence, we obtain quantitative bounds for the number of solutions to any linear system of equations of finite complexity in the primes, with the same shape of error terms. We also obtain the first quantitative bounds on the size of sets containing no $k$-term arithmetic progressions with shifted prime difference.2021-07-05T17:41:32Z57 pages; Further referee comments incorporated; to appear in J. Eur. Math. SocTerence TaoJoni Teräväinen10.4171/JEMS/1404http://arxiv.org/abs/2005.03811v2On the connection between the Goldbach conjecture and the Elliott-Halberstam conjecture2022-08-28T23:01:51ZIn this paper we prove that the binary Goldbach conjecture for sufficiently large even integers would follow under the assumption that both the Elliott-Halberstam conjecture and a variant of the Elliott-Halberstam conjecture twisted by the Möbius function hold, in which the sum of their levels of distribution exceeds 1. This continues the work of Pan in 1982. An analogous result for the twin prime conjecture is obtained by Ram Murty and Vatwani in 2017.2020-05-08T01:09:24Ztitle changed, typos corrected, https://doi.org/10.1007/978-3-030-67996-5_17Jing-Jing HuangHuixi Li10.1007/978-3-030-67996-5_17