Pith. sign in

REVIEW 3 cited by

Correlations of the Riemann zeta function

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.10123 v2 pith:KZL75AKN submitted 2023-03-17 math.NT

classification math.NT
keywords alphabetazetafunctionworkchandeeldotsmoments
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Assuming the Riemann hypothesis, we investigate the shifted moments of the zeta function \[ M_{\alpha,{\beta}}(T) = \int_T^{2T} \prod_{k = 1}^m |\zeta(\tfrac{1}{2} + i (t + \alpha_k))|^{2 \beta_k} dt \] introduced by Chandee, where ${\alpha} = {\alpha}(T) = (\alpha_1, \ldots, \alpha_m)$ and ${\beta} = (\beta_1 \ldots , \beta_m)$ satisfy $|\alpha_k| \leq T/2$ and $\beta_k\geq 0$. We shall prove that \[ M_{{\alpha},{\beta}}(T) \ll_{{\beta}} T (\log T)^{\beta_1^2 + \cdots + \beta_m^2} \prod_{1\leq j < k \leq m} |\zeta(1 + i(\alpha_j - \alpha_k) + 1/ \log T )|^{2\beta_j \beta_k}. \] This improves upon the previous best known bounds due to Chandee and Ng, Shen, and Wong, particularly when the differences $|\alpha_j - \alpha_k|$ are unbounded as $T \rightarrow \infty$. The key insight is to combine work of Heap, Radziwi{\l}{\l}, and Soundararajan and work of the author with the work of Harper on the moments of the zeta function.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lower bounds for high moments of zeta sums

    math.NT 2025-06 conditional novelty 6.0 of 10

    For every k>2, unconditionally, the average of |∑_{n≤x} n^{-it}|^{2k} over t∈[0,T] is ≫_k x^k (log L)^{(k-1)^2}, where L = min{x, T/x}.

  2. Information-Theoretically Secure Aggregation for Lightweight Federated Learning: Resilient to Dropouts and Adversaries

    cs.LG 2026-07 reject novelty 5.0 of 10

    A secure aggregation protocol for sign-based federated learning computes the majority vote in one round with linear offline cost, but the claimed degree-halving simplification breaks at zero inputs and for inverse terms.

  3. Hi-SAFE: Hierarchical Secure Aggregation for Lightweight Federated Learning

    cs.LG 2025-11 conditional novelty 5.0 of 10

    Hi-SAFE privately computes the signSGD majority vote using a Fermat-based indicator polynomial evaluated with Beaver triples, and uses subgrouping to keep per-user cost independent of n.

Pith tools