CS 746: Riemann Hypothesis and Its Applications

CS 746: Riemann Hypothesis and Its Applications

Prerequisites

MTH102, MTH103, or equivalent

Course Contents:

Riemann Hypothesis is one of the most important unresolved conjectures in mathematics. It connects the distribution of prime numbers with zeroes of Zeta function, defined on the complex plane. A number of algorithms in algebra and numbertheory rely on the correctness of Riemann Hypothesis or its generalizations. This course willdescribe the connection between prime distributions and Zeta function leading to the Riemann Hypothesis, prove Prime Number Theorem along the way, and then describe the generalizations of Riemann Hypothesis and their applications to computer science problems.

Topics:

1. Prime counting and other arithmetic functions
   
2. Brief overview of complex analysis
   
3. Zeta function definition and basic properties
   
4. Riemann Hypothesis and its relationship with prime counting
   
5. Prime Number Theorem
   
6. Dirichlet L-functions and Generalized Riemann Hypothesis
   
7. Applications of Riemann and Generalized Riemann Hypothesis
   
8. Further extensions of Riemann Hypothesis and its proof for function fields, and elliptic curves over finite fields

Books and References:

1. M. Ram Murty. Problems in Analytical Number Theory. Graduate Text in Mathematics 206, Springer 2001.
   
2. Peter Borwein, Stephen Choi, Brendan Rooney, AnderaWierathmueller. The Riemann Hypothesis. Springer 2006. (Available here).
   
3. Research papers.