Gap problems for integer-valued multiplicative functions
Abstract
Motivated by questions about the typical sizes of gaps |f(n+1)-f(n)| in the sequence (f(n))n, where f is an integer-valued multiplicative function, we investigate the set of solutions \n ∈ N : f(n+a) = f(n) + b\, ab ≠ 0. We formulate a conjecture classifying those multiplicative functions for which this set has logarithmic density zero, and prove that the conjectured classification is tight. Moreover, using techniques from additive combinatorics building on previous work of the author, we show how to reduce the classification problem to the study of "local power maps" modulo prime , i.e., maps g: N Z for which there is 0 ≤ k < -1 such that g(n) nk for all n ∈ N. We prove a partial result towards our classification conjecture by employing a strategy of N. Jones that uses Kummer theory to study local power maps modulo many primes .
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.