A structure theorem for level sets of multiplicative functions and applications
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 , , with we have We also show that if a level set of a multiplicative function has positive upper density, then any self-shift , , is a set of averaging polynomial multiple recurrence. This in turn leads to the following refinement of the polynomial Szemer\'edi theorem (cf. [4]). Let be a level set of an arbitrary multiplicative function, suppose has positive upper density and let . Then for any set with positive upper density and any polynomials , , which satisfy and for all , there exists such that the set has positive lower density.
Cite
@article{arxiv.1708.02613,
title = {A structure theorem for level sets of multiplicative functions and applications},
author = {Vitaly Bergelson and Joanna Kułaga-Przymus and Mariusz Lemańczyk and Florian K. Richter},
journal= {arXiv preprint arXiv:1708.02613},
year = {2022}
}
Comments
32 pages. Formerly part of arXiv:1705.07322