Papers
Topics
Authors
Recent
Search
2000 character limit reached

On some classification problems of multiplicative functions

Published 12 May 2025 in math.NT and math.DS | (2505.07277v1)

Abstract: We prove that a multiplicative function $f:\mathbb{N}\to\mathbb{C}$ is Toeplitz if and only if there are a Dirichlet character $\chi$ and a finite subset $F$ of prime numbers such that $f(n)=\chi(n)$ for each $n$ which is coprime to all numbers from $F$. 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 2 likes about this paper.