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

In this note, we give a combinatorial and noncomputational 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 poin...

Full description

Bibliographic Details
Main Authors: Assiotis, T, Keating, JP
Format: Journal article
Language:English
Published: World Scientific Publishing 2020
_version_ 1826273998773682176
author Assiotis, T
Keating, JP
author_facet Assiotis, T
Keating, JP
author_sort Assiotis, T
collection OXFORD
description In this note, we give a combinatorial and noncomputational 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.
first_indexed 2024-03-06T22:36:45Z
format Journal article
id oxford-uuid:5a294513-01a5-4492-8d0c-a403b99e8ff1
institution University of Oxford
language English
last_indexed 2024-03-06T22:36:45Z
publishDate 2020
publisher World Scientific Publishing
record_format dspace
spelling oxford-uuid:5a294513-01a5-4492-8d0c-a403b99e8ff12022-03-26T17:14:07ZMoments of moments of characteristic polynomials of random unitary matrices and lattice point countsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:5a294513-01a5-4492-8d0c-a403b99e8ff1EnglishSymplectic ElementsWorld Scientific Publishing2020Assiotis, TKeating, JPIn this note, we give a combinatorial and noncomputational 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.
spellingShingle Assiotis, T
Keating, JP
Moments of moments of characteristic polynomials of random unitary matrices and lattice point counts
title Moments of moments of characteristic polynomials of random unitary matrices and lattice point counts
title_full Moments of moments of characteristic polynomials of random unitary matrices and lattice point counts
title_fullStr Moments of moments of characteristic polynomials of random unitary matrices and lattice point counts
title_full_unstemmed Moments of moments of characteristic polynomials of random unitary matrices and lattice point counts
title_short Moments of moments of characteristic polynomials of random unitary matrices and lattice point counts
title_sort moments of moments of characteristic polynomials of random unitary matrices and lattice point counts
work_keys_str_mv AT assiotist momentsofmomentsofcharacteristicpolynomialsofrandomunitarymatricesandlatticepointcounts
AT keatingjp momentsofmomentsofcharacteristicpolynomialsofrandomunitarymatricesandlatticepointcounts