SearcharxivSearch

arXiv · 2208.08827

Characteristic Polynomials of Orthogonal and Symplectic Random Matrices, Jacobi Ensembles & L-functions

Abstract

Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been considered in various works to estimate the asymptotics of moments of L-function families. In this paper, we first consider joint moments of the characteristic polynomial of a symplectic random matrix and its second derivative. We obtain the asymptotics, along with a representation of the leading order coefficient in terms of the solution of a Painleve equation. This gives us the conjectural asymptotics of the corresponding joint moments over families of Dirichlet L-functions. In doing so, we compute the asymptotics of a certain additive Jacobi statistic, which could be of independent interest in random matrix theory. Finally, we consider a slightly different type of joint moment that is the analogue of an average considered over the unitary group in various works before. We obtain the asymptotics and the leading order coefficient explicitly.

Explore related subjects

Keep this discovery

BibTeXRIS

Mustafa Alper Gunes. 2022-08-18. Characteristic Polynomials of Orthogonal and Symplectic Random Matrices, Jacobi Ensembles & L-functions. https://arxiv.org/abs/2208.08827

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