A structure theorem for level sets of multiplicative functions and applications
Abstract
Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [13,14], a structure theorem which gives a decomposition of 1E 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 E=\n1<n2<…\ be a level set of an arbitrary multiplicative function with positive density. Then the following are equivalent: - E is divisible, i.e. the upper density of the set E uN is positive for all u∈N; - E is an averaging set of polynomial multiple recurrence, i.e. for all measure preserving systems (X,B,μ,T), all A∈B with μ(A)>0, all ≥ 1 and all polynomials pi∈Z[x], i=1,…,, with pi(0)=0 we have N∞1NΣj=1N μ(A T-p1(nj)A… T-p(nj)A)>0. We also show that if a level set E of a multiplicative function has positive upper density, then any self-shift E-r, r∈ E, 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 E be a level set of an arbitrary multiplicative function, suppose E has positive upper density and let r∈ E. Then for any set D⊂ N with positive upper density and any polynomials pi∈Q[t], i=1,…,, which satisfy pi(Z)⊂Z and pi(0)=0 for all i∈\1,…,\, there exists β>0 such that the set \\,n∈ E-r:d(D (D-p1(n)) …(D-p(n)) )>β \,\ has positive lower density.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.