Good weights for the Erdos discrepancy problem
Abstract
The Erdos discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem, for weights given either by structured sequences that enjoy some irrationality features, or certain random sequences. As an intermediate result, we establish unboundedness of weighted sums of bounded multiplicative functions and products of shifts of such functions. A key ingredient in our analysis for the structured weights, is a structural result for measure preserving systems naturally associated with bounded multiplicative functions that was recently obtained in joint work with B. Host.
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.