Moments of characteristic polynomials at random matrix Gram points

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 2kth moment of the characteristic polynomial averaged over the random matrix Gram points is larger than the 2kth 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.

Spectral moments and characteristic polynomials of vertex expansion hypergraphs of graphs
Ge Lin, Changjiang Bu
arXiv5 Sep 2026PreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
Painlevé representations for joint moments of characteristic polynomials from the orthogonal and unitary symplectic groups
Theodoros Assiotis, Thomas Bothner, Jonathan P. Keating +2
arXiv21 Oct 2026PreprintarXiv licenceFull textAlgebra & number theory Mathematical physicsarXiv
Simultaneously preperiodic points and colliding orbits for families of polynomials in characteristic p
Jungin Lee, GyeongHyeon Nam
arXiv13 Oct 2026PreprintarXiv licenceFull textAlgebra & number theory Dynamical systemsarXiv
Averages of traces and ratios of characteristic polynomials of random unitary matrices
Ada Bendel, Rhys Cahill, John Brian Conrey +4
arXiv23 Oct 2026PreprintCC BY 4.0Full textMathematical physicsarXiv
Correlated Gaussian Moments Determine Polynomials up to Orthogonal Equivalence
Obayda Julien Assaad
arXiv12 Oct 2026PreprintarXiv licenceFull textAlgebra & number theory ProbabilityarXiv

Cite

BibTeX RIS

BibTeX

@misc{hughes2026moments,
  title = {{Moments of characteristic polynomials at random matrix Gram points}},
  author = {Christopher Hughes and Somin Kim},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.39856},
  eprint = {2610.39856},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.39856},
}

RIS

TY  - UNPB
TI  - Moments of characteristic polynomials at random matrix Gram points
AU  - Christopher Hughes
AU  - Somin Kim
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.39856
UR  - https://arxiv.org/abs/2610.39856
AB  - 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 2kth moment of the characteristic polynomial averaged over the random matrix Gram points is larger than the 2kth 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.
ER  -

Abstract

Related

Cite