L-Functions in Analytic Number Theory

In 2000, Shiu proved that there are infinitely many primes whose last digit is 1 such that the next prime also ends in a 1. However, it is an open problem to show that there are infinitely many primes ending in 1 such that the next prime ends in 3. In this talk, we'll instead consider the sequence of sums of two squares in increasing order. In particular, we'll show that there are infinitely many sums of two squares ending in 1 such that the next sum of two squares ends in 3. We'll show further that all patterns of length 3 occur infinitely often: for any modulus q, every sequence (a mod q, b mod q, c mod q) appears infinitely often among consecutive sums of two squares. We'll discuss some of the proof techniques, and explain why they fail for primes. Joint work with Noam Kimmel.

We discuss the role of long Dirichlet polynomials in number theory. We first survey some applications of mean values of long Dirichlet polynomials over primes in the theory of the Riemann zeta function which includes central limit theorems and pair correlation of zeros. We then give some examples showing how, on assuming the Riemann Hypothesis, one can compute asymptotics for such mean values without using the Hardy-Littlewood conjectures for additive correlations of the von-Mangoldt functions.

By using an identity relating a sum to an integral, we obtain a family of identities for the averages \(M(X)=\sum_{n\leq X} \mu(n)\) and \(m(X)=\sum_{n\leq X} \mu(n)/n\). Further, by choosing some specific families, we study two summatory functions related to the Möbius function, \(\mu(n)\), namely \(\sum_{n\leq X} \mu(n)/n^s\) and \(\sum{n\leq X} \mu(n)/n^s \log(X/n)\), where \(s\) is a complex number and \(\Re s >0\). We also explore some applications and examples when s is real. (joint work with O. Ramaré)

In the late 90's, Keating and Snaith used random matrix theory to predict the exact leading terms of conjectural asymptotic formulas for all integral moments of the Riemann zeta-function. Prior to their work, no number-theoretic argument or heuristic has led to such exact predictions for all integral moments. In 2015, Conrey and Keating revisited the approach of using divisor sum heuristics to predict asymptotic formulas for moments of zeta. Essentially, their method estimates moments of zeta using lower twisted moments. In this talk, I will discuss a rigorous random matrix theory analogue of the Conrey-Keating heuristic. This is ongoing joint work with Brian Conrey.

The Hardy and Littlewood k-tuple prime conjecture is one of the most enduring unsolved problems in mathematics. In 1999, Gadiyar and Padma presented a heuristic derivation of the 2-tuples conjecture by employing the orthogonality principle of Ramanujan sums. Building upon their work, we explore triple convolution Ramanujan sums and use this approach to provide a heuristic derivation of the Hardy-Littlewood conjecture concerning prime 3-tuples. Furthermore, we estimate the triple convolution of the Jordan totient function using Ramanujan sums.