Moments of characteristic polynomials at random matrix Gram points

We evaluate the characteristic polynomial of a random unitary matrix at the points on the unit circle where the polynomial takes real values. In analogy to the Riemann zeta function we call these the ``random matrix Gram points''. On the random matrix side we answer in the affirmative a question of Richard Hall, who expected that zeta on the Gram points should be larger than typical. We prove that for any fixed positive $k$, the $2k$th moment of the characteristic polynomial averaged over the random matrix Gram points is larger than the $2k$th moment of the characteristic polynomial averaged over the whole unit circle. For large $N$ the leading-order asymptotic term is the same size, but all lower-order terms are larger. In an appendix we show how to adapt the heuristic recipe of Conrey--Farmer--Keating--Rubinstein--Snaith to conjecture moments of zeta at Gram points, and show by example that the second and fourth moments calculated by following the recipe agree with previously proven results.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.39856
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Moments of characteristic polynomials at random matrix Gram points

Somin Kim, C. P. Hughes
arXiv (Cornell University)
Analytic Number Theory Research
preprint

Moments of characteristic polynomials at random matrix Gram points

Somin Kim, C. P. Hughes
preprint en

Abstract

We evaluate the characteristic polynomial of a random unitary matrix at the points on the unit circle where the polynomial takes real values. In analogy to the Riemann zeta function we call these the ``random matrix Gram points''. On the random matrix side we answer in the affirmative a question of Richard Hall, who expected that zeta on the Gram points should be larger than typical. We prove that for any fixed positive $k$, the $2k$th moment of the characteristic polynomial averaged over the random matrix Gram points is larger than the $2k$th moment of the characteristic polynomial averaged over the whole unit circle. For large $N$ the leading-order asymptotic term is the same size, but all lower-order terms are larger. In an appendix we show how to adapt the heuristic recipe of Conrey--Farmer--Keating--Rubinstein--Snaith to conjecture moments of zeta at Gram points, and show by example that the second and fourth moments calculated by following the recipe agree with previously proven results.

arXiv (Cornell University)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon