We show that the moments of the smooth counting function of a set of points encodes the same information as the $n$-level density of these points. If the points are the eigenvalues of matrices taken from the classical compact groups with Haar measure, then we show that the first few moments of the smooth counting function are Gaussian, while the distribution is not. The same phenomenon occurs for smooth counting functions of the zeros of $L$--functions, and we give examples relating to each classical compact group. The advantage of calculating moments of the counting function is that combinatorially, they are far easier to handle than the $n$-level densities.
|Title of host publication||Recent Perspectives in Random Matrix Theory and Number Theory|
|Publisher||Cambridge University Press|
|Number of pages||19|
|Publication status||Published - Jul 2005|
|Name||London Mathematical Society lecture Note Series|