Papers
Topics
Authors
Recent
Search
2000 character limit reached

In support of $n$-correlation

Published 21 Dec 2012 in math.NT | (1212.5537v2)

Abstract: In this paper we examine $n$-correlation for either the eigenvalues of a unitary group of random matrices or for the zeros of a unitary family of $L$-functions in the important situation when the correlations are detected via test functions whose Fourier transforms have limited support. This problem first came to light in the work of Rudnick and Sarnak in their study of the $n$-correlation of zeros of a fairly general automorphic $L$-function. They solved the simplest instance of this problem when the total support was most severely limited, but had to work extremely hard to show their result matched random matrix theory in the appropriate limit. This is because they were comparing their result to the familiar determinantal expressions for $n$-correlation that arise naturally in random matrix theory. In this paper we deal with arbitrary support and show that there is another expression for the $n$-correlation of eigenvalues that translates easily into the number theory case and allows for immediate identification of which terms survive the restrictions placed on the support of the test function.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.