We study the characteristic polynomials Z(U, θ) of matrices U in the Circular Unitary Ensemble (CUE) of Random Matrix Theory. Exact expressions for any matrix size N are derived for the moments of |Z| and Z/Z*, and from these we obtain the asymptotics of the value distributions and cumulants of the real and imaginary parts of log Z as N→∞. In the limit, we show that these two distributions are independent and Gaussian. Costin and Lebowitz [15] previously found the Gaussian limit distribution for Im log Z using a different approach, and our result for the cumulants proves a conjecture made by them in this case. We also calculate the leading order N→∞ asymptotics of the moments of |Z| and Z/Z*. These CUE results are then compared with what is known about the Riemann zeta function ζ (s) on its critical line Re s= 1/2, assuming the Riemann hypothesis. Equating the mean density of the non-trivial zeros of the zeta function at a height T up the critical line with the mean density of the matrix eigenvalues gives a connection between N and T. Invoking this connection, our CUE results coincide with a theorem of Selberg for the value distribution of log ζ(1/2+iT) in the limit T→∞. They are also in close agreement with numerical data computed by Odlyzko [29] for large but finite T. This leads us to a conjecture for the moments of |ζ(1/2+it) |. Finally, we generalize our random matrix results to the Circular Orthogonal (COE) and Circular Symplectic (CSE) Ensembles.

/pdf/random-matrix-theory-and-z-1-2-it-3xihgkn7e2.pdf

Random Matrix Theory and ζ(1/2+it)

Old and new problems and results in combinatorial number theory

We introduce a general result relating "short averages" of a multiplicative function to "long averages" which are well understood. This result has several consequences. First, for the M\"obius function we show that there are cancellations in the sum of $\mu(n)$ in almost all intervals of the form $[x, x + \psi(x)]$ with $\psi(x) \rightarrow \infty$ arbitrarily slowly. This goes beyond what was previously known conditionally on the Density Hypothesis or the stronger Riemann Hypothesis. Second, we settle the long-standing conjecture on the existence of $x^{\epsilon}$-smooth numbers in intervals of the form $[x, x + c(\varepsilon) \sqrt{x}]$, recovering unconditionally a conditional (on the Riemann Hypothesis) result of Soundararajan. Third, we show that the mean-value of $\lambda(n)\lambda(n+1)$, with $\lambda(n)$ Liouville's function, is non-trivially bounded in absolute value by $1 - \delta$ for some $\delta > 0$. This settles an old folklore conjecture and constitutes progress towards Chowla's conjecture. Fourth, we show that a (general) real-valued multiplicative function $f$ has a positive proportion of sign changes if and only if $f$ is negative on at least one integer and non-zero on a positive proportion of the integers. This improves on many previous works, and is new already in the case of the M\"obius function. We also obtain some additional results on smooth numbers in almost all intervals, and sign changes of multiplicative functions in all intervals of square-root length.

/pdf/multiplicative-functions-in-short-intervals-33nzwrqbg6.pdf

Multiplicative functions in short intervals

In 1918 G. Hardy and J. Littlewood proved an asymptotic estimate for the Second moment of the modulus of the Riemann zeta-function on the segment [1/2,1/2+iT] in the complex plane, as T tends to infinity. In 1926 Ingham proved an asymptotic estimate for the fourth moment. However, since Ingham's result, nobody has proved an asymptotic formula for any higher moment. Recently J. Conrey and A. Ghosh conjectured a formula for the sixth moment. We develop a new heuristic method to conjecture the asymptotic size of both the sixth and eighth moments. Our estimate for the sixth moment agrees with and strongly supports, in a sense made clear in the paper, the one conjectured by Conrey and Ghosh. Moreover, both our sixth and eighth moment estimates agree with those conjectured recently by J. Keating and N. Snaith based on modeling the zeta-function by characteristic polynomials of random matrices from the Gaussian unitary ensemble. Our method uses a conjectural form of the approximate functional equation for the zeta-function, a conjecture on the behavior of additive divisor sums, and D. Goldston and S. Gonek's mean value theorem for long Dirichlet polynomials. We also consider the question of the maximal order of the zeta-function on the critical line.

High moments of the Riemann zeta-function

How Many Prime Numbers Are There?.- How to Recognize Whether a Natural Number is a Prime.- Are There Functions Defining Prime Numbers?.- How Are the Prime Numbers Distributed?.- Which Special Kinds of Primes Have Been Considered?.- Heuristic and Probabilistic Results About Prime Numbers.

The Little Book of Bigger Primes

Lectures on transcendental numbers

Next I considered the case where k is half of any positive integer and proved (1) (however with C1 depending possibly on k). Next D. R. Heath-Brown [1] considered the case H = T and k any positive rational number and proved (1) (however with C1 depending possibly on k). Next M. Jutila [4] considered the case H = T and k = q−1 and proved (1) with C1 independent of k. For all these references see also my book [6]. Two other excellent reference books are [7] and [2].

/pdf/fractional-moments-of-the-riemann-zeta-function-2b9l1q97sq.pdf

Fractional moments of the Riemann zeta-function

A Note on Numbers with a Large Prime Factor

On the Frequency of Titchmarsh's Phenomenon for Ζ(S)

On the zeros of a class of generalised Dirichlet series-X

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

K. Ramachandra

Author Tools

Chat about Author