Title: Prime number theorem for GL(n)

advertisement

Title: Prime number theorem for GL(n)

Prime number theorem for GL(n)
Dorian Goldfeld
September 18, 2015
The classical prime number theorem states that the number of primes less than
x is asymptotic to x/ log x as x tends to infinity. This result is obtained by studying
the Riemann zeta function. In this talk I will discuss generalizations of the prime
number theorem in the case where the Riemann zeta function is replaced by higher
rank L-functions on GL(n) with n > 1.
1

Related documents

Prime Number Races

Prime Number Races

素数之恋

A positive number greater than 1 is prime if it can be divided only by

A positive number greater than 1 is prime if it can be divided only by

An elementary formulation of Riemann`s Zeta function

An elementary formulation of Riemann`s Zeta function

The Prime Number Theorem - Jonathan Hanke`s Website

The Prime Number Theorem - Jonathan Hanke`s Website

Coupled Oscillations Interaction-4 Riemann zeta function

Coupled Oscillations Interaction-4 Riemann zeta function

18.034 PROBLEM SET 5

18.034 PROBLEM SET 5

Fundamental Theorem of Arithmetic - Personal.psu.edu

Fundamental Theorem of Arithmetic - Personal.psu.edu

SHINYA KOYAMA, Zeta Institute The double Riemann zeta function

SHINYA KOYAMA, Zeta Institute The double Riemann zeta function

Some calculations related to the Riemann Zeta function for integer

Some calculations related to the Riemann Zeta function for integer

Experimental Verification of the Prime Number Theorem

Experimental Verification of the Prime Number Theorem

In mathematics, and in particular number theory, the fundamental

In mathematics, and in particular number theory, the fundamental

Download

advertisement