A note on log-type GCD sums and derivatives of the Riemann zeta function
Daodao Yang

TL;DR
This paper establishes tight upper bounds for log-type GCD sums, generalizing Gál's theorem, and connects these bounds to the behavior of derivatives of the Riemann zeta function on the 1-line.
Contribution
It provides two methods—unconditional spectral norm bounds and conditional zeta derivative bounds—to analyze log-type GCD sums, extending previous results.
Findings
Sharp upper bounds for spectral norms near α=1
Upper bounds for log-type GCD sums established
Conditional link between GCD sums and zeta derivatives
Abstract
In [Yan22a], we defined so-called ``log-type" GCD sums and proved the lower bounds . We will establish the upper bounds in this note, which generalizes G\'{a}l's theorem on GCD sums (corresponding to the case ). This result will be proved by two different methods. The first method is unconditional. We establish sharp upper bounds for spectral norms along lines when tends to with certain fast rates. As a corollary, we obtain upper bounds for log-type GCD sums. The second method is conditional. We prove that lower bounds for log-type GCD sums can produce lower bounds for large values of derivatives of the Riemann zeta function on the 1-line. So from conditional upper bound for $\left|…
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.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematical Approximation and Integration · Limits and Structures in Graph Theory
