On some classification problems of multiplicative functions
S. Kasjan, O. Klurman, M. Lema\'nczyk

TL;DR
This paper characterizes Toeplitz multiplicative functions, links pretentiousness to Furstenberg systems, and connects Elliott's conjecture with the uniqueness of Furstenberg systems for bounded multiplicative functions.
Contribution
It provides a complete characterization of Toeplitz multiplicative functions and establishes a connection between pretentiousness, Furstenberg systems, and conjectures in multiplicative number theory.
Findings
Toeplitz multiplicative functions are characterized by Dirichlet characters and finite prime sets.
Bounded pretentious functions have exactly one Furstenberg system.
Corrected Elliott's conjecture implies the uniqueness of Furstenberg systems for bounded multiplicative functions.
Abstract
We prove that a multiplicative function is Toeplitz if and only if there are a Dirichlet character and a finite subset of prime numbers such that for each which is coprime to all numbers from . All such functions bounded by~1 are necessarily pretentious and they have exactly one Furstenberg system. Moreover, we characterize the class of pretentious functions that have precisely one Furstenberg system as those being Besicovitch (rationally) almost periodic. As a consequence, we show that the corrected Elliott's conjecture implies Frantzikinakis-Host's conjecture on the uniqueness of Furstenberg system for all real-valued bounded by~1 multiplicative functions. We also clarify relations between different classes of aperiodic multiplicative functions.
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
TopicsMathematical Dynamics and Fractals · semigroups and automata theory · Analytic Number Theory Research
