Search arXivSearch

arXiv · 2409.04844

Moments of traces of random symplectic matrices and hyperelliptic $L$-functions

Abstract

We study matrix integrals of the form $$\int_{\mathrm{USp(2n)}}\prod_{j=1}^k\mathrm{tr}(U^j)^{a_j}\mathrm d U,$$ where $a_1,\ldots,a_r$ are natural numbers and integration is with respect to the Haar probability measure. We obtain a compact formula (the number of terms depends only on $\sum a_j$ and not on $n,k$) for the above integral in the non-Gaussian range $\sum_{j=1}^kja_j\le 4n+1$. This extends results of Diaconis-Shahshahani and Hughes-Rudnick who obtained a formula for the integral valid in the (Gaussian) range $\sum_{j=1}^kja_j\le n$ and $\sum_{j=1}^kja_j\le 2n+1$ respectively. We derive our formula using the connection between random symplectic matrices and hyperelliptic $L$-functions over finite fields, given by an equidistribution result of Katz and Sarnak, and an evaluation of a certain multiple character sum over the function field $\mathbb F_q(x)$. We apply our formula to study the linear statistics of eigenvalues of random unitary symplectic matrices in a narrow bandwidth sampling regime.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexei Entin, Noam Pirani. 2024-09-07. Moments of traces of random symplectic matrices and hyperelliptic $L$-functions. https://arxiv.org/abs/2409.04844

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR