On the multiplicative independence between $n$ and $\lfloor \alpha n\rfloor$
David Crn\v{c}evi\'c, Felipe Hern\'andez, Kevin Rizk, Khunpob, Sereesuchart, Ran Tao

TL;DR
This paper studies the multiplicative independence of sequences involving floors of irrational multiples, proving asymptotic uncorrelation and applying it to a 2D Erdős-Kac theorem and a variation of Chowla's conjecture.
Contribution
It establishes a general asymptotic uncorrelation result for sequences derived from irrational multiples and applies it to key problems in number theory.
Findings
Sequences are asymptotically uncorrelated for a large class of functions.
Proves a 2D Erdős-Kac theorem for the sequences involving floors of irrational multiples.
Shows a variation of Chowla's conjecture with logarithmic averages tending to zero.
Abstract
In this article we investigate different forms of multiplicative independence between the sequences and for irrational . Our main theorem shows that for a large class of arithmetic functions the sequences and are asymptotically uncorrelated. This new theorem is then applied to prove a -dimensional version of the Erd\H{o}s-Kac theorem, asserting that the sequences and behave as independent normally distributed random variables with mean and standard deviation . Our main result also implies a variation on Chowla's Conjecture asserting that the logarithmic average of $(\lambda(n) \lambda ( \lfloor \alpha n…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematical Dynamics and Fractals · Computability, Logic, AI Algorithms
