Mean values of arithmetic functions in short intervals and in arithmetic progressions in the large-degree limit
Ofir Gorodetsky

TL;DR
This paper proves that for a broad class of arithmetic functions over function fields, their mean values in short intervals and arithmetic progressions asymptotically match the global mean, especially in the large-degree limit.
Contribution
It establishes asymptotic equivalences for factorization functions in short intervals and progressions in the large-degree setting, extending known results to this new context.
Findings
Asymptotic mean value results hold for factorization functions in short intervals.
Results are valid in the large-degree limit with fixed base field.
Stronger than analogous integer results, using symmetric functions and recent character sum bounds.
Abstract
A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as large as possible. We study this problem in the function field setting, and prove for a wide class of arithmetic functions (namely factorization functions), that such an asymptotic result holds, allowing the size of the short interval to be as small as a square-root of the size of the full interval, and analogously for arithmetic progressions. For instance, our results apply for the indicator function of polynomials with a divisor of given degree, and are much stronger than those known for the analogous function over the integers. As opposed to many previous works, our results apply in the \emph{large-degree limit}, where the base field…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
