A structure theorem for level sets of multiplicative functions and applications
Vitaly Bergelson, Joanna Ku{\l}aga-Przymus, Mariusz Lema\'nczyk and, Florian K. Richter

TL;DR
This paper establishes a structure theorem for level sets of multiplicative functions, linking their properties to polynomial recurrence and refining results like the polynomial Szemerédi theorem.
Contribution
It introduces a decomposition of level sets into almost periodic and pseudo-random parts, enabling new results on polynomial recurrence and density properties.
Findings
Level sets of multiplicative functions with positive density are divisible.
Such sets are averaging sets for polynomial multiple recurrence.
Refinement of polynomial Szemerédi theorem for multiplicative function level sets.
Abstract
Given a level set of an arbitrary multiplicative function , we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of into an almost periodic and a pseudo-random parts. Using this structure theorem together with the technique developed by the authors in [3], we obtain the following result pertaining to polynomial multiple recurrence. Let be a level set of an arbitrary multiplicative function with positive density. Then the following are equivalent: - is divisible, i.e. the upper density of the set is positive for all ; - is an averaging set of polynomial multiple recurrence, i.e. for all measure preserving systems , all with , all and all polynomials…
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.
