SearcharxivSearch

arXiv · 1611.10037

On the critical points of random matrix characteristic polynomials and of the Riemann $\xi$-function

Abstract

A one-parameter family of point processes describing the distribution of the critical points of the characteristic polynomial of large random Hermitian matrices on the scale of mean spacing is investigated. Conditionally on the Riemann hypothesis and the multiple correlation conjecture, we show that one of these limiting processes also describes the distribution of the critical points of the Riemann $\xi$-function on the critical line. We prove that each of these processes boasts stronger level repulsion than the sine process describing the limiting statistics of the eigenvalues: the probability to find $k$ critical points in a short interval is comparable to the probability to find $k+1$ eigenvalues there. We also prove a similar property for the critical points and zeros of the Riemann $\xi$-function, conditionally on the Riemann hypothesis but not on the multiple correlation conjecture.

Explore related subjects

Keep this discovery

BibTeXRIS

Sasha Sodin. 2016-11-30. On the critical points of random matrix characteristic polynomials and of the Riemann $\xi$-function. https://doi.org/10.1093/qmath/hax033

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