Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Fourier transform on high-dimensional unitary groups with applications to random tilings
This is not the latest version of this item. The latest version can be found here.

Fourier transform on high-dimensional unitary groups with applications to random tilings

Thumbnail Image
Download
Name

1712.09925.pdf

Description
Submitted version
Size

2.03 MB

Format

Adobe PDF

Checksum (MD5)

bc194ee257f315f2f1c24f4e7da858a6

sword-2019-11-13T15:35:48.original.xml (130 B)
Original SWORD entry document
Publisher
Duke University Press
Version
Original manuscript
Abstract
© 2019 Duke University Press. All rights reserved. A combination of direct and inverse Fourier transforms on the unitary group U(N) identifies normalized characters with probability measures on N-tuples of integers. We develop the N → ∞ version of this correspondence by matching the asymptotics of partial derivatives at the identity of logarithm of characters with the law of large numbers and the central limit theorem for global behavior of corresponding random N-tuples. As one application we study fluctuations of the height function of random domino and lozenge tilings of a rich class of domains. In this direction we prove the Kenyon- Okounkov conjecture (which predicts asymptotic Gaussianity and the exact form of the covariance) for a family of non-simply-connected polygons. Another application is a central limit theorem for the U(N) quantum random walk with random initial data.
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/132186
DOI of Published Version
10.1215/00127094-2019-0023
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.