Search arXivSearch

arXiv · 2608.16108

Two averaged dynamical generalizations of Chowla's conjecture

Abstract

Let $k\ge1$ be an integer and let $λ$ be the Liouville function. In 1965, Chowla gave a conjecture that the values of $λ(n+h_1),\dots, λ(n+h_k)$ are asymptotically unrelated for any distinct natural numbers $h_1, \dots, h_k$. In this article, motivated by the recent work of Bergelson and Richter on the dynamical generalizations of the prime number theorem, we will show a dynamical generalization of Chowla's conjecture on average. In the proof, we follow an approach of Qi and Zheng who established a variant of Bergelson and Richter's theorem over irreducible binary cubic forms. Moreover, we will use this approach to show an analogue of the dynamical Chowla's conjecture along the primes on average. In 2016, Tao proved that the two-point logarithmic Chowla's conjecture holds. Recently, Charamaras and Richter generalized Tao's theorem to bounded arithmetic functions and proposed a conjecture that generalizes Chowla's conjecture to bounded multi-variable arithmetic functions. Building on their work, we prove a dynamical generalization of Tao's theorem and a variant for the composition of the sum-of-digits function with the prime Omega function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Biao Wang. 2026-08-29. Two averaged dynamical generalizations of Chowla's conjecture. https://arxiv.org/abs/2608.16108

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT