A lower bound for the variance in arithmetic progressions of some multiplicative functions close to 1
Abstract
We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to 1. Specifically, we consider αN-fold divisor functions, when αN is a sequence of positive real numbers approaching 1 in a suitable way or αN=1, and the indicator of y-smooth numbers, for suitably large parameters y. As a corollary, we will strengthen a previous author's result on the first subject and obtain matching lower bounds to some Barban-Davenport-Halberstam type theorems for y-smooth numbers. Incidentally, we will also find a lower bound for the variance in arithmetic progressions of the prime factors counting functions ω(n) and (n).
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.