Loading...
research article
A Structure Theorem for Level Sets of Multiplicative Functions and Applications
March 1, 2020
Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of $1_{E}$ into an almost periodic and a pseudo-random part. Using this structure theorem together with the technique developed by the authors in [3], we obtain the following result pertaining to polynomial multiple recurrence.
Type
research article
ArXiv ID
1708.02613
Authors
Publication date
2020-03-01
Published in
Volume
2020
Issue
5
Start page
1300
End page
1345
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
November 26, 2021
Use this identifier to reference this record