Paper detail

Moments of moments of characteristic polynomials of random unitary matrices and lattice point counts

In this note we give a combinatorial and non-computational proof of the asymptotics of the integer moments of the moments of the characteristic polynomials of Haar distributed unitary matrices as the size of the matrix goes to infinity. This is achieved by relating these quantities to a lattice point count problem. Our main result is a new explicit expression for the leading order coefficient in the asymptotic as a volume of a certain region involving continuous Gelfand-Tsetlin patterns with constraints.

preprint2020arXivOpen access

Signal facts

What is known right now

Open access2 authors4 topics

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.