Search arXivSearch

arXiv · 2608.23500

Logarithmic Chowla Correlations Across All Shift Scales

Abstract

Let $λ(n)=(-1)^{Ω(n)}$ be the Liouville function. We prove a fixed power-logarithmic bound for its logarithmically weighted two-point correlations across the full shift range. There is an absolute $c>0$ such that every sufficiently large $x$ admits a single set $\mathcal E_x\subseteq[1,x]$ with $|\mathcal E_x\cap[1,H]|\ll_A H(\log x)^{-A}$ $(1\le H\le x)$ for every fixed $A>0$, while $\max_{\substack{1\le h\le x\ h\notin\mathcal E_x}}\sup_{1\le y\le x}\left|\sum_{n\le y}\frac{λ(n)λ(n+h)}{n}\right|\ll(\log x)^{1-c}$. The same exceptional-set formulation extends, without an upper cutoff, to all positive integer shifts. Earlier full-range theorems average over the shift; here a fixed saving holds pointwise outside one set whose density in every initial segment is smaller than every fixed negative power of $\log x$. The new middle-scale argument combines a general-good-modulus Liouville deletion lemma with a linear bad-modulus score, a progression Fourier estimate, and a Mellin-localized dilation that separates divisor-dependent endpoints. Maximal fixed-moment bounds evacuate the low prefix and control the long-shift range. Assuming GRH for primitive Dirichlet $L$-functions, we also prove, uniformly for $h\in\mathbb N$ and $1\le y\le x$, $\left|\sum_{n\le y}\frac{λ(n)λ(n+h)}{n}\right|\le\log(2\min{h,y})+O((\log x)^{1-c_{\mathrm G}})$ for an absolute $c_{\mathrm G}>0$, with no exceptional shifts.

Explore related subjects

Keep this discovery

BibTeXRIS

Jizhou Guo. 2026-09-01. Logarithmic Chowla Correlations Across All Shift Scales. https://arxiv.org/abs/2608.23500

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Eleven, twelve, and thirteen lonely runners

Wills conjectured that, for any non-zero integers $u_1,\ldots,u_k$, there is a real number $t$ such that, for all $i=1,\ldots,k$, \[\lVert tu_i\rVert\geq\frac{1}{k+1},\] where $\lVert x\rVert$ is the distance from $x$ to the closest integer. This statement is known as the Lonely Runner Conjecture. A computational method developed by Rosenfeld and the second author verified the conjecture for $k\leq9$. We further refine this method with new sieving techniques and employ a polynomial method argument to show that any $(u_1,\ldots,u_k)\equiv(1,2,\ldots,k)\pmod{p}$ with $\gcd(u_1,\ldots,u_k)=1$ satisfies the conjecture when $k+1$ and $p > k^2+k$ are both odd primes. Ultimately, we provide a computer-assisted proof of the Lonely Runner Conjecture for $k\in\{10,11,12\}$.

math.CO

Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments

We present a combinatorial proof of Simonis type MacWilliams identity for harmonic higher weight distributions of linear codes. Furthermore, we investigate the statistical moments of the harmonic higher weight enumerators for random linear codes. Defining the enumerators via rank functions of the generator matrices of linear codes, we prove that its expectation vanishes for all non-trivial harmonic functions due to the inherent symmetry of random matrices, and we also derive an explicit, non-trivial formula for the covariance.

math.CO

New classes of trace-form permutation polynomials and their compositional inverses

We construct permutation polynomials of the form x + γTr^{q^2}_q(h(x)) over the finite field F_{q^2}. More precisely, we present two families ofpermutation polynomials whose coefficients range over all elements of the field rather than being restricted to a proper subfield. We also compute the compositional inverses of both families. Our techniques involve the evaluation of certain Kloosterman sums together with the analysis of some equations over finite fields, and we believe these can be of independent interest.

math.NT