TME-EMT Wiki¶
Fully explicit results in multiplicative number theory are often scattered through the litterature. The aim of this site is to present annoted bibliographies in order to keep track of the current knowledge. By the way, the acronym TME-EMT stands for¶
Théorie Multiplicative Explicite des nombres / Explicit Multiplicative number Theory
Managing editors: André de Camargo.
Note
Modifications are to be sent to: tmeemt.wiki@gmail.com
Programming and Python side: Dominique Benielli (Aix Marseille Université, Cellule de développement Institut Archimède)
Here are the contributors:
Olivier Bordellès, André de Camargo, Pierre Dusart, Charles Greathouse, Harald Helfgott, Kiran S. Kedlaya, Ethan Lee, Pieter Moree, Akhilesh P, Olivier Ramaré, Enrique Treviño.
- Explicit bounds on primes
- Explicit bounds on the Moebius function
- Exact computations of the number of primes
- Computations of arithmetical constants
- Explicit results on exponential sums
- Bounds for the Gamma function
- Bounds for \(|\zeta(s)|\), \(|L(s,\chi)|\) and related questions
- Size of \(L(1,\chi)\)
- Explicit zero-free regions for the \(\zeta\) and \(L\) functions
- Short intervals containing primes
- Averages of non-negative multiplicative functions
- Integer Points near Smooth Plane Curves
- Explicit pointwise upper bounds for some arithmetic functions
- Explicit bounds for class numbers
- Sieve bounds
- Character sums
- Tools on Fourier transforms
- Tools on Mellin transforms
- Bounds on the Dedekind zeta-function
- Primitive Roots
- Primes in number fields
- Bibliography