Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. On the Local Fourier Uniformity Problem for Small Sets
 
research article

On the Local Fourier Uniformity Problem for Small Sets

Kanigowski, Adam
•
Lemańczyk, Mariusz
•
Richter, Florian K.  
Show more
August 1, 2024
International Mathematics Research Notices

We consider vanishing properties of exponential sums of the Liouville function λ of the form lim lim sup log1X mΣ≤X m1 sup α∈C|||| H1 Σ λ(m + h)e2πihα |||| = 0, H→∞ X→∞ h≤H where C ⊂ T. The case C = T corresponds to the local 1-Fourier uniformity conjecture of Tao, a central open problem in the study of multiplicative functions with far-reaching number-theoretic applications. We show that the above holds for any closed set C ⊂ T of zero Lebesgue measure. Moreover, we prove that extending this to any set C with non-empty interior is equivalent to the C = T case, which shows that our results are essentially optimal without resolving the full conjecture. We also consider higher-order variants. We prove that if the linear phase e2πihα is replaced by a polynomial phase e2πihtα for t ≥ 2 then the statement remains true for any set C of upper box-counting dimension < 1/t. The statement also remains true if the supremum over linear phases is replaced with a supremum over all nilsequences coming form a compact countable ergodic subsets of any t-step nilpotent Lie group. Furthermore, we discuss the unweighted version of the local 1-Fourier uniformity problem, showing its validity for a class of “rigid” sets (of full Hausdorff dimension) and proving a density result for all closed subsets of zero Lebesgue measure.

  • Details
  • Metrics
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés