Indexed metadata

Moments of characteristic polynomials at random matrix Gram points

Christopher Hughes, Somin Kim

Source record

Source: arXiv

Published: Oct 29, 2026

arXiv: 2610.39856

Open original source ↗

Source 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 kk, the 2k2kth moment of the characteristic polynomial averaged over the random matrix Gram points is larger than the 2k2kth moment of the characteristic polynomial averaged over the whole unit circle. For large NN 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Moments of characteristic polynomials at random matrix Gram points — Mathematical Frontier Network