Thompson, Matthew (2022) Random Matrix Theory and Refined Large Deviations of the Riemann Zeta Function. PhD thesis, University of York.
Abstract
The analogy between the Riemann zeta function and the topic of random matrix theory was first established by Keating and Snaith [35]. Following this, many mathematicians have attempted to answer number-theoretic questions using random matrix theory. One such question is the maximum of the Riemann zeta function up to a height T along the critical line, and Farmer, Gonek, Hughes established a conjecture for this maximum [21].
Our work builds upon these ideas and goes further in that we compute refined large deviations results for the characteristic polynomial of a random CbetaE matrix, generalising the CUE results of Farmer, Gonek and Hughes. We then apply these ideas to the Riemann zeta function, where we utilise a Hybrid Euler-Hadamard result of Gonek, Hughes and Keating [26] and compute refined large deviations results for each of these models separately.
Our results are consistent with the original works cited throughout this thesis, however there are some difference between the results of the two models, which we attempt to clarify here. Numerical results are presented to support (where possible) the results in this thesis.
Metadata
Supervisors: | Hughes, Christopher |
---|---|
Awarding institution: | University of York |
Academic Units: | The University of York > Mathematics (York) |
Depositing User: | Mr Matthew Thompson |
Date Deposited: | 29 Jul 2024 11:56 |
Last Modified: | 29 Jul 2024 11:56 |
Open Archives Initiative ID (OAI ID): | oai:etheses.whiterose.ac.uk:34976 |
Download
Examined Thesis (PDF)
Filename: Thompson_205031020_RevisedThesisClean.pdf
Licence:
This work is licensed under a Creative Commons Attribution NonCommercial NoDerivatives 4.0 International License
Export
Statistics
You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.